full
search.png

Search

close.png

Cancel

arrow
Volume 20, Issue 1
Relaxed Asynchronous Iterations for the Linear Complementarity Problem

Zhong-Zhi Bai & Yu-Guang Huang

J. Comp. Math., 20 (2002), pp. 97-112.

Published online: 2002-02

Preview Full PDF 3474 25748

Cited by

google scholar semantic scholar
Export citation
  • Abstract

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.

  • Keywords

Linear complementarity problem, Matrix multisplitting, Relaxation method, Asynchronous iteration, Convergence theory.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-20-97, author = {Bai , Zhong-Zhi and Huang , Yu-Guang}, title = {Relaxed Asynchronous Iterations for the Linear Complementarity Problem}, journal = {Journal of Computational Mathematics}, year = {2002}, volume = {20}, number = {1}, pages = {97--112}, abstract = {

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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8902.html} }
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 -

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.

Bai , Zhong-Zhi and Huang , Yu-Guang. (2002). Relaxed Asynchronous Iterations for the Linear Complementarity Problem. Journal of Computational Mathematics. 20 (1). 97-112. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard