Relaxed Parallel Modulus-Based Matrix Multisplitting Iterative Methods for Linear Complementarity Problem

Abstract

In this paper, the authors establish a class of relaxed parallel modulus-based matrix multisplitting iteration methods for large sparse linear complementarity problems, based on the multisplittings of the coefficient matrix. And then, they prove their convergence when the system matrices are H-matrix with positive diagonal elements. These results naturally present convergence conditions for the symmetric positive definite matrices and the M-matrices.