Two-step modulus-based matrix splitting iteration method for linear complementarity problems |
| |
Authors: | Li-Li Zhang |
| |
Institution: | 1.State Key Laboratory of Scientific/Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing,Academy of Mathematics and Systems Science, Chinese Academy of Sciences,Beijing,People’s Republic of China |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|