Find in Library

We present a modified Picard-like method to solve absolute value equations by equivalently expressing the implicit fixed-point equation form of the absolute value equations as a two-by-two block nonlinear equation. This unifies some existing matrix splitting algorithms and improves the efficiency of the algorithm by introducing the parameter <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ω</mi></semantics></math></inline-formula>. For the choice of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ω</mi></semantics></math></inline-formula> in the new method, we give a way to determine the quasi-optimal values. Numerical examples are given to show the feasibility of the proposed method. It is also shown that the new method is better than those proposed by Ke and Ma in 2017 and Dehghan and Shirilord in 2020.