full
search.png

Search

close.png

Cancel

arrow
Volume 12, Issue 3
Two-Step Modulus-Based Matrix Splitting Iteration Methods for a Class of Implicit Complementarity Problems

Yan Wang, Jun-Feng Yin, Quan-Yu Dou & Rui Li

DOI: 10.4208/nmtma.OA-2018-0034

Numer. Math. Theor. Meth. Appl., 12 (2019), pp. 867-883.

Published online: 2019-04

Preview Purchase PDF 2444 39568

Cited by

google scholar semantic scholar
Export citation
  • Abstract

Modulus-based matrix splitting iteration methods were recently proposed for solving implicit complementarity problems. In this paper, to solve a class of implicit complementarity problems, two-step modulus-based matrix splitting iteration methods are presented and analyzed. The convergence theorems are established when the system matrix is an $H$+-matrix. Numerical results show that the proposed methods are efficient and can accelerate the convergence performance with less iteration steps and CPU time.

  • Keywords

Implicit complementarity problems, modulus-based matrix splitting, $H_+$-matrix, convergence.

  • AMS Subject Headings

90C33, 65F10, 65F50

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{NMTMA-12-867, author = {Yan Wang, Jun-Feng Yin, Quan-Yu Dou and Rui Li}, title = {Two-Step Modulus-Based Matrix Splitting Iteration Methods for a Class of Implicit Complementarity Problems}, journal = {Numerical Mathematics: Theory, Methods and Applications}, year = {2019}, volume = {12}, number = {3}, pages = {867--883}, abstract = {

Modulus-based matrix splitting iteration methods were recently proposed for solving implicit complementarity problems. In this paper, to solve a class of implicit complementarity problems, two-step modulus-based matrix splitting iteration methods are presented and analyzed. The convergence theorems are established when the system matrix is an $H$+-matrix. Numerical results show that the proposed methods are efficient and can accelerate the convergence performance with less iteration steps and CPU time.

}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.OA-2018-0034}, url = {http://global-sci.org/intro/article_detail/nmtma/13134.html} }
TY - JOUR T1 - Two-Step Modulus-Based Matrix Splitting Iteration Methods for a Class of Implicit Complementarity Problems AU - Yan Wang, Jun-Feng Yin, Quan-Yu Dou & Rui Li JO - Numerical Mathematics: Theory, Methods and Applications VL - 3 SP - 867 EP - 883 PY - 2019 DA - 2019/04 SN - 12 DO - http://doi.org/10.4208/nmtma.OA-2018-0034 UR - https://global-sci.org/intro/article_detail/nmtma/13134.html KW - Implicit complementarity problems, modulus-based matrix splitting, $H_+$-matrix, convergence. AB -

Modulus-based matrix splitting iteration methods were recently proposed for solving implicit complementarity problems. In this paper, to solve a class of implicit complementarity problems, two-step modulus-based matrix splitting iteration methods are presented and analyzed. The convergence theorems are established when the system matrix is an $H$+-matrix. Numerical results show that the proposed methods are efficient and can accelerate the convergence performance with less iteration steps and CPU time.

Yan Wang, Jun-Feng Yin, Quan-Yu Dou and Rui Li. (2019). Two-Step Modulus-Based Matrix Splitting Iteration Methods for a Class of Implicit Complementarity Problems. Numerical Mathematics: Theory, Methods and Applications. 12 (3). 867-883. doi:10.4208/nmtma.OA-2018-0034
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard