Abstract
The SOR-like iteration method for solving the system of absolute value equations of finding a vector x such that Ax-|x|-b=0 with ν=‖A-1‖2<1 is investigated. The convergence conditions of the SOR-like iteration method proposed by Ke and Ma (Appl. Math. Comput., 311:195–202, 2017) are revisited and a new proof is given, which exhibits some insights in determining the convergent region and the optimal iteration parameter. Along this line, the optimal parameter which minimizes ‖Tν(ω)‖2 with (Formula presented.) and the approximate optimal parameter which minimizes an upper bound of ‖Tν(ω)‖2 are explored. The optimal and approximate optimal parameters are iteration-independent, and the bigger value of ν is, the smaller convergent region of the iteration parameter ω is. Numerical results are presented to demonstrate that the SOR-like iteration method with the optimal parameter is superior to that with the approximate optimal parameter proposed by Guo et al. (Appl. Math. Lett., 97:107–113, 2019).
| Original language | English |
|---|---|
| Pages (from-to) | 799-826 |
| Number of pages | 28 |
| Journal | Numerical Algorithms |
| Volume | 96 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 2024 |
Keywords
- 65F10
- 65H10
- 90C30
- Absolute value equations
- Convergence condition
- Optimal iteration parameter
- SOR-like iteration method
Fingerprint
Dive into the research topics of 'Optimal parameter of the SOR-like iteration method for solving absolute value equations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver