full
search.png

Search

close.png

Cancel

arrow
Volume 33, Issue 1
Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems

Lili Zhang

DOI: 10.4208/jcm.1403-m4195

J. Comp. Math., 33 (2015), pp. 100-112.

Published online: 2015-02

Preview Full PDF 3324 33495

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

Linear complementarity problem, Modulus-based method, Matrix multisplitting, Convergence.

  • AMS Subject Headings

65F10, 68W10, 90C33.

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address

zhangll@lsec.cc.ac.cn (Lili Zhang)

  • BibTex
  • RIS
  • TXT
@Article{JCM-33-100, author = {Zhang , Lili}, title = {Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems}, journal = {Journal of Computational Mathematics}, year = {2015}, volume = {33}, number = {1}, pages = {100--112}, 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.

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

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.

Zhang , Lili. (2015). Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems. Journal of Computational Mathematics. 33 (1). 100-112. doi:10.4208/jcm.1403-m4195
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard