TY - JOUR
T1 - Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems
AU - Zhang , Lili
JO - Journal of Computational Mathematics
VL - 1
SP - 100
EP - 112
PY - 2015
DA - 2015/02
SN - 33
DO - http://doi.org/10.4208/jcm.1403-m4195
UR - https://global-sci.org/intro/article_detail/jcm/9829.html
KW - Linear complementarity problem, Modulus-based method, Matrix multisplitting, Convergence.
AB - <p style="text-align: justify;">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.</p>