The General Modulus-based Jacobi Iteration Method for Linear Complementarity Problems

For the large sparse linear complementarity problem, by reformulating them as implicit fixed-point equations problems, relying on matrix-splittings, many modulus methods are produced. In this paper, the general modulus Jacobi method and its convergence property were established, and the domain and the optimum value of the parameter are presented in one special situation. Numerical results show that this method is superior to some other modulus methods in computing efficiency and feasible aspects in some situations.