TY - JOUR
T1 - Relaxed Asynchronous Iterations for the Linear Complementarity Problem
AU - Bai , Zhong-Zhi
AU - Huang , Yu-Guang
JO - Journal of Computational Mathematics
VL - 1
SP - 97
EP - 112
PY - 2002
DA - 2002/02
SN - 20
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8902.html
KW - Linear complementarity problem, Matrix multisplitting, Relaxation method, Asynchronous iteration, Convergence theory.
AB - <p style="text-align: justify;">We present a class of relaxed asynchronous parallel multisplitting iterative methods for solving the linear complementarity problem on multiprocessor systems, and set up their convergence theories when the system matrix of the linear complementarity problem is an H-matrix with positive diagonal elements.</p>