Journal
NUMERICAL ALGORITHMS
Volume 64, Issue 2, Pages 245-262Publisher
SPRINGER
DOI: 10.1007/s11075-012-9664-9
Keywords
Linear complementarity problem; Matrix splitting; Iterative method; Convergence
Categories
Funding
- National Natural Science Foundation of China [11271289, U1135003]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available