Residential College | false |
Status | 已發表Published |
A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems | |
Zheng,Hua1; Vong,Seakweng2 | |
2021-04 | |
Source Publication | Numerical Algorithms |
ISSN | 1017-1398 |
Volume | 86Issue:4Pages:1791-1810 |
Abstract | In this paper, for solving horizontal linear complementarity problems, a two-step modulus-based matrix splitting iteration method is established. The convergence analysis of the proposed method is presented, including the case of accelerated overrelaxation splitting. Numerical examples are reported to show the efficiency of the proposed method. |
Keyword | Horizontal Linear Complementarity Problem Modulus-based Method h+-matrix |
DOI | 10.1007/s11075-020-00954-1 |
URL | View the original |
Indexed By | SCIE |
Language | 英語English |
WOS Research Area | Mathematics |
WOS Subject | Mathematics, Applied |
WOS ID | WOS:000560024100001 |
Scopus ID | 2-s2.0-85085760138 |
Fulltext Access | |
Citation statistics | |
Document Type | Journal article |
Collection | DEPARTMENT OF MATHEMATICS |
Corresponding Author | Vong,Seakweng |
Affiliation | 1.School of Mathematics and Statistics,Shaoguan University,Shaoguan,China 2.Department of Mathematics,University of Macau,Macao |
Corresponding Author Affilication | University of Macau |
Recommended Citation GB/T 7714 | Zheng,Hua,Vong,Seakweng. A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems[J]. Numerical Algorithms, 2021, 86(4), 1791-1810. |
APA | Zheng,Hua., & Vong,Seakweng (2021). A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems. Numerical Algorithms, 86(4), 1791-1810. |
MLA | Zheng,Hua,et al."A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems".Numerical Algorithms 86.4(2021):1791-1810. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment