中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems

文献类型:期刊论文

作者Bai, ZZ; Huang, YG
刊名JOURNAL OF COMPUTATIONAL MATHEMATICS
出版日期2003-11-01
卷号21期号:6页码:773-790
关键词linear complementarity problem matrix multisplitting relaxation method asynchronous iteration convergence theory
ISSN号0254-9409
英文摘要Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive diagonal elements. Moreover, block and multi-parameter variants of the new methods, together with their convergence properties, are investigated in detail. Numerical results show that these new methods can achieve high parallel efficiency for solving the large sparse linear complementarity problems on multiprocessor systems.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000186851300008
出版者VSP BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/18655]  
专题中国科学院数学与系统科学研究院
通讯作者Bai, ZZ
作者单位1.Chinese Acad Sci, Acad Math & Syst Sci, ICMSEC, LSEC, Beijing 100080, Peoples R China
2.Univ Oxford, Comp Lab, Programming Res Grp, Oxford OX1 3QD, England
推荐引用方式
GB/T 7714
Bai, ZZ,Huang, YG. A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2003,21(6):773-790.
APA Bai, ZZ,&Huang, YG.(2003).A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems.JOURNAL OF COMPUTATIONAL MATHEMATICS,21(6),773-790.
MLA Bai, ZZ,et al."A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems".JOURNAL OF COMPUTATIONAL MATHEMATICS 21.6(2003):773-790.

入库方式: OAI收割

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

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

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