In this paper, a relaxation modulus-based matrix splitting iteration method is established, which covers the known general modulus-based matrix splitting iteration methods. The convergence analysis and the strategy of the choice of the parameters are given. Numerical examples show that the proposed methods are efficient and accelerate the convergence performance with less iteration steps and CPU times.
['Hua Zheng', 'Wen Li', 'Seakweng Vong']
A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems