The SOR-like iteration method for solving the absolute value equations~(AVE) 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 ([{\em 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 $$T_ν(ω) = \left(\begin{array}{cc} |1-ω| & ω^2ν\\ |1-ω| & |1-ω| +ω^2ν\end{array}\right)$$ and the approximate optimal parameter which minimizes $η_ν(ω) =\max\{|1-ω|,νω^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, Wu and Li ([{\em Appl. Math. Lett.}, 97:107--113, 2019]). In some situation, the SOR-like itration method with the optimal parameter performs better, in terms of CPU time, than the generalized Newton method (Mangasarian, [{\em Optim. Lett.}, 3:101--108, 2009]) for solving the AVE.
The nonlinear HSS-like iteration method for absolute value equations
School of Mathematics and Statistics, Lanzhou University(兰州大学数学与统计学院);School of Mathematics and Statistics, Hexi University(河西学院数学与统计学院);School of Chemistry and Chemical Engineering, Hexi University(河西学院化学化工学院)
An inverse-free fixed-time stable dynamical system and its forward-Euler discretization for solving generalized absolute value equations
School of Mathematics and Computational Science, Xiangtan University(湘潭大学数学与计算科学学院);School of Mathematics and Statistics, Fujian Normal University(福建师范大学数学与统计学院);Institute for Optimization and Decision Analytics, Liaoning Technical University(辽宁工业大学优化与决策分析研究所);School of Mathematical Sciences, Beihang University(北京航空航天大学数学科学学院)
A Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration
MPI for Informatics, Saarland Informatics Campus(德国马克斯·普朗克计算机科学研究所);MPC-VCC and Saarbrücken Graduate School of Computer Science(萨尔布吕肯计算机科学研究学院);Institute of Mathematical Sciences Chennai(印度马德拉斯数学科学研究所);Courant Institute of Mathematical Sciences, New York University(纽约大学库朗数学科学研究所)