The SOR-like iteration method for solving the system of absolute value equations of finding a vector x such that Ax-|x|-b=0\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$Ax - |x| - b = 0$$\end{document} with ν=‖A-1‖2<1\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\nu = \Vert A^{-1}\Vert _2 < 1$$\end{document} 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\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\Vert T_\nu (\omega )\Vert _2$$\end{document} with Tν(ω)=|1-ω|ω2ν|1-ω||1-ω|+ω2ν\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\begin{aligned} T_\nu (\omega ) = \left( \begin{array}{cc} |1-\omega | &{} \omega ^2\nu \\ |1-\omega | &{} |1-\omega | +\omega ^2\nu \end{array}\right) \end{aligned}$$\end{document}and the approximate optimal parameter which minimizes an upper bound of ‖Tν(ω)‖2\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\Vert T_\nu (\omega )\Vert _2$$\end{document} are explored. The optimal and approximate optimal parameters are iteration-independent, and the bigger value of ν\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\nu $$\end{document} is, the smaller convergent region of the iteration parameter ω\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega $$\end{document} 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).
