More on matrix splitting modulus-based iterative methods for solving linear complementarity problem.

In this article, we present a class of new modified modulus-based matrix spitting methods to process the large and sparse linear complementarity problem (LCP). Using two positive diagonal matrices, we formulate an implicit fixed-point equation that is equivalent to a LCP and an iterative method is presented to solve the LCP with a P-matrix based on a fixed-point equation. Also, we provide some sufficient convergence conditions for the proposed methods when the system matrix is an H + -matrix. We provide two numerical examples to demonstrate the efficiency of the proposed methods. [ABSTRACT FROM AUTHOR]