Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems

Preview Full PDF

Authors

Abstract

To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an $H_+$-matrix, which improve the existing convergence theory. Numerical results show that the symmetric modulus-based multisplitting relaxation methods are effective in actual implementation.

About this article

Abstract View

Pdf View

DOI

10.4208/jcm.1403-m4195

How to Cite

Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems. (2018). Journal of Computational Mathematics, 33(1), 100-112. https://doi.org/10.4208/jcm.1403-m4195