KMS Of Academy of mathematics and systems sciences, CAS
A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems | |
Bai Zhongzhi1; Huang Yuguang2 | |
2003 | |
发表期刊 | Journal of Computational Mathematics |
ISSN | 0254-9409 |
卷号 | 21期号:6页码:773 |
摘要 | 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. |
语种 | 英语 |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/18656 |
专题 | 中国科学院数学与系统科学研究院 |
作者单位 | 1.中国科学院数学与系统科学研究院 2.Programming Research Group, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD |
推荐引用方式 GB/T 7714 | Bai Zhongzhi,Huang Yuguang. A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems[J]. Journal of Computational Mathematics,2003,21(6):773. |
APA | Bai Zhongzhi,&Huang Yuguang.(2003).A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems.Journal of Computational Mathematics,21(6),773. |
MLA | Bai Zhongzhi,et al."A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problems".Journal of Computational Mathematics 21.6(2003):773. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Bai Zhongzhi]的文章 |
[Huang Yuguang]的文章 |
百度学术 |
百度学术中相似的文章 |
[Bai Zhongzhi]的文章 |
[Huang Yuguang]的文章 |
必应学术 |
必应学术中相似的文章 |
[Bai Zhongzhi]的文章 |
[Huang Yuguang]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论