Journal
NUMERICAL ALGORITHMS
Volume 57, Issue 1, Pages 83-99Publisher
SPRINGER
DOI: 10.1007/s11075-010-9416-7
Keywords
Linear complementarity problem; Matrix splitting; Iteration method; Convergence
Categories
Ask authors/readers for more resources
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.
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