A new matrix splitting generalized iteration method for linear complementarity problems

被引：9

作者：

Ali, Rashid ^{[1
,2
]}

Akgul, Ali ^{[3
,4
,5
]}

机构：

[1] Zhejiang Normal Univ, Sch Math Sci, 688 Yingbin Rd, Jinhua 321004, Zhejiang, Peoples R China

[2] Cent South Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R China

[3] Siirt Univ, Art & Sci Fac, Dept Math, TR-56100 Siirt, Turkiye

[4] Lebanese Amer Univ, Dept Comp Sci & Math, Beirut, Lebanon

[5] Near East Univ, Math Res Ctr, Dept Math, Near East Blvd,Nicosia Mersin 10, TR-99138 Istanbul, Turkiye

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2024年 / 464卷

关键词：

Linear complementarity problems; Iteration methods; Matrix decomposition; Convergence; H-matrix; SUCCESSIVE OVERRELAXATION METHOD; CONVERGENCE;

D O I：

10.1016/j.amc.2023.128378

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The linear complementarity problems (LCPs) can be encountered in various scientific computing, management science, and operations research. In this study, we introduce and analyze a new generalized accelerated overrelaxation (NGAOR) method for solving LCPs, in which one special case reduces to a new generalized successive overrelaxation (NGSOR) method. Moreover, we prove the convergence of the proposed methods when the system matrix is an H-matrix (irreducible or strictly diagonally dominant matrix). Numerical results for several experiments are present to show the effectiveness and efficiency of the proposed methods. AMS classification: 65F10, 90C33

引用

页数：9

共 30 条

[1] SOLUTION OF NONSYMMETRIC LINEAR COMPLEMENTARITY-PROBLEMS BY ITERATIVE METHODS [J].