Two-step modulus-based matrix splitting iteration method for linear complementarity problems
文献类型：期刊论文
| 作者 | Zhang, Li-Li |
| 刊名 | NUMERICAL ALGORITHMS
 |
| 出版日期 | 2011-05-01 |
| 卷号 | 57期号:1页码:83-99 |
| 关键词 | Linear complementarity problem Matrix splitting Iteration method Convergence |
| ISSN号 | 1017-1398 |
| DOI | 10.1007/s11075-010-9416-7 |
| 英文摘要 | Bai has recently presented a modulus-based matrix splitting iteration method, which is a powerful alternative for solving the large sparse linear complementarity problems. In this paper, we further present a two-step modulus-based matrix splitting iteration method, which consists of a forward and a backward sweep. Its convergence theory is proved when the system matrix is an H (+) -matrix. Moreover, for the two-step modulus-based relaxation iteration methods, more exact convergence domains are obtained without restriction on the Jacobi matrix associated with the system matrix, which improve the existing convergence theory. Numerical results show that the two-step modulus-based relaxation iteration methods are superior to the modulus-based relaxation iteration methods for solving the large sparse linear complementarity problems. |
| 语种 | 英语 |
| WOS记录号 | WOS:000289302800006 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/12356]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Zhang, Li-Li |
| 作者单位 | Chinese Acad Sci, Acad Math & Syst Sci, State Key Lab Sci Engn Comp, Inst Computat Math & Sci Engn Comp, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhang, Li-Li. Two-step modulus-based matrix splitting iteration method for linear complementarity problems[J]. NUMERICAL ALGORITHMS,2011,57(1):83-99. |
| APA | Zhang, Li-Li.(2011).Two-step modulus-based matrix splitting iteration method for linear complementarity problems.NUMERICAL ALGORITHMS,57(1),83-99. |
| MLA | Zhang, Li-Li."Two-step modulus-based matrix splitting iteration method for linear complementarity problems".NUMERICAL ALGORITHMS 57.1(2011):83-99. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。