4.6 Article

Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem

期刊

NUMERICAL ALGORITHMS
卷 64, 期 2, 页码 245-262

出版社

SPRINGER
DOI: 10.1007/s11075-012-9664-9

关键词

Linear complementarity problem; Matrix splitting; Iterative method; Convergence

资金

  1. National Natural Science Foundation of China [11271289, U1135003]

向作者/读者索取更多资源

For the large sparse linear complementarity problem, a class of accelerated modulus-based matrix splitting iteration methods is established by reformulating it as a general implicit fixed-point equation, which covers the known modulus-based matrix splitting iteration methods. The convergence conditions are presented when the system matrix is either a positive definite matrix or an H (+)-matrix. Numerical experiments further show that the proposed methods are efficient and accelerate the convergence performance of the modulus-based matrix splitting iteration methods with less iteration steps and CPU time.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据