中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem

文献类型:期刊论文

作者Bai, ZZ
刊名JOURNAL OF COMPUTATIONAL MATHEMATICS
出版日期2001-05-01
卷号19期号:3页码:281-292
关键词linear complementarity problem matrix multisplitting chaotic iteration relaxed method convergence property
ISSN号0254-9409
英文摘要A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that highly parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.
语种英语
WOS记录号WOS:000169371600006
出版者VSP BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/16487]  
专题中国科学院数学与系统科学研究院
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn COmp, State Key Lab Sci Engn Comp, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Bai, ZZ. Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2001,19(3):281-292.
APA Bai, ZZ.(2001).Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem.JOURNAL OF COMPUTATIONAL MATHEMATICS,19(3),281-292.
MLA Bai, ZZ."Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem".JOURNAL OF COMPUTATIONAL MATHEMATICS 19.3(2001):281-292.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。