A Novel Globally Convergent Parallel Iteration Method for Large Sparse Implicit Complementarity Problems

In this paper, a novel parallel modulus-based synchronous multisplitting iteration method is designed for solving large sparse implicit complementarity problems. Subsequently, under the assumption that the system matrix is an H-matrix, globally convergent conditions for the proposed method are established, extending the existing convergence results for the corresponding serial method. Finally, numerical experiments demonstrate that the proposed method achieves favorable parallel efficiency.