.png){kind=icon}
.png){kind=icon}
Return
A new matrix splitting generalized iteration method for linear complementarity problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2023.128378.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Keywords:
Linear complementarity problems
Iteration methods
Matrix decomposition
Convergence
H-matrix
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W