Volume 48, Issue 1
Modulus-based GSTS Iteration Method for Linear Complementarity Problems

Min-Li Zeng & Guo-Feng Zhang

J. Math. Study, 48 (2015), pp. 1-17.

Published online: 2015-03

Preview Full PDF 511 1629
Export citation
  • Abstract

In this paper, amodulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an H+-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iterationmethod is studied in detail. By choosing different parameters, a series of existing and newiterativemethods are derived, including themodulus-based Jacobi (MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental results are given to show the effectiveness and feasibility of the new method when it is employed for solving this class of linear complementarity problems.

  • Keywords

GSTS method modulus-based iteration method linear complementarity problem H_+-matrix symmetric positive definite matrix

  • AMS Subject Headings

65F10 65F50 65G40 90C33

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address

zengml12@lzu.edu.cn (Min-Li Zeng)

gf_zhang@lzu.edu.cn (Guo-Feng Zhang)

  • BibTex
  • RIS
  • TXT
@Article{JMS-48-1, author = {Zeng , Min-Li and Zhang , Guo-Feng }, title = {Modulus-based GSTS Iteration Method for Linear Complementarity Problems}, journal = {Journal of Mathematical Study}, year = {2015}, volume = {48}, number = {1}, pages = {1--17}, abstract = {In this paper, amodulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an H+-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iterationmethod is studied in detail. By choosing different parameters, a series of existing and newiterativemethods are derived, including themodulus-based Jacobi (MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental results are given to show the effectiveness and feasibility of the new method when it is employed for solving this class of linear complementarity problems.}, issn = {2617-8702}, doi = {https://doi.org/10.4208/jms.v48n1.15.01}, url = {http://global-sci.org/intro/article_detail/jms/9906.html} }
TY - JOUR T1 - Modulus-based GSTS Iteration Method for Linear Complementarity Problems AU - Zeng , Min-Li AU - Zhang , Guo-Feng JO - Journal of Mathematical Study VL - 1 SP - 1 EP - 17 PY - 2015 DA - 2015/03 SN - 48 DO - http://dor.org/10.4208/jms.v48n1.15.01 UR - https://global-sci.org/intro/article_detail/jms/9906.html KW - GSTS method KW - modulus-based iteration method KW - linear complementarity problem KW - H_+-matrix KW - symmetric positive definite matrix AB - In this paper, amodulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an H+-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iterationmethod is studied in detail. By choosing different parameters, a series of existing and newiterativemethods are derived, including themodulus-based Jacobi (MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental results are given to show the effectiveness and feasibility of the new method when it is employed for solving this class of linear complementarity problems.
Min-Li Zeng & Guo-Feng Zhang. (2019). Modulus-based GSTS Iteration Method for Linear Complementarity Problems. Journal of Mathematical Study. 48 (1). 1-17. doi:10.4208/jms.v48n1.15.01
Copy to clipboard
The citation has been copied to your clipboard