full
search.png

Search

close.png

Cancel

arrow
Volume 19, Issue 3
Parallel Chaotic Multisplitting Iterative Methods for the Large Sparse Linear Complementarity Problem

Zhong-Zhi Bai

J. Comp. Math., 19 (2001), pp. 281-292.

Published online: 2001-06

Preview Full PDF 2596 24821

Cited by

google scholar semantic scholar
Export citation
  • Abstract

A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that high parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.  

  • Keywords

Linear complementarity problem, Matrix multisplitting, Chaotic iteration, Relaxed method, Convergence property.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-19-281, author = {Bai , Zhong-Zhi}, title = {Parallel Chaotic Multisplitting Iterative Methods for the Large Sparse Linear Complementarity Problem}, journal = {Journal of Computational Mathematics}, year = {2001}, volume = {19}, number = {3}, pages = {281--292}, abstract = {

A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that high parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.  

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8980.html} }
TY - JOUR T1 - Parallel Chaotic Multisplitting Iterative Methods for the Large Sparse Linear Complementarity Problem AU - Bai , Zhong-Zhi JO - Journal of Computational Mathematics VL - 3 SP - 281 EP - 292 PY - 2001 DA - 2001/06 SN - 19 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8980.html KW - Linear complementarity problem, Matrix multisplitting, Chaotic iteration, Relaxed method, Convergence property. AB -

A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that high parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.  

Bai , Zhong-Zhi. (2001). Parallel Chaotic Multisplitting Iterative Methods for the Large Sparse Linear Complementarity Problem. Journal of Computational Mathematics. 19 (3). 281-292. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard