.png){kind=icon}
.png){kind=icon}
Return
Sor-like iteration method for solving piecewise linear systems
.png){kind=icon}
PRE
AI
DOI：10.1007/s40314-026-03862-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces an SOR-like iteration method for solving piecewise linear systems (PLS). The method is derived from a two-by-two block nonlinear reformulation of the original problem combined with a matrix-splitting strategy. Under mild assumptions, global convergence results are established and admissible ranges for the relaxation parameter are obtained. Moreover, by analyzing the spectral radius of an associated matrix, it is shown that $$\omega =1$$ is the optimal parameter with respect to the derived global convergence estimate. Numerical examples are provided to illustrate the efficiency and effectiveness of the proposed method.
Keywords:
Piecewise linear systems
SOR-like method
Convergence
Journal
C
IF:
2.5
Papers:
54
Citations:
0