Search

Purpose: This study presents a two-step numerical iteration method specifically designed to solve absolute value equations. The proposed method is valuable and efficient for solving absolute value equations. Several numerical examples were taken to demonstrate the accuracy and efficiency of the proposed method. Design/methodology/approach: We present a two-step numerical iteration method for solving absolute value equations. Our two-step method consists of a predictor-corrector technique. The new method uses the generalized Newton method as the predictor step. The four-point open Newton-Cotes formula is considered the corrector step. The convergence of the proposed method is discussed in detail. This new method is highly effective for solving large systems due to its simplicity and effectiveness. We consider the beam equation, using the finite difference method to transform it into a system of absolute value equations, and then solve it using the proposed method. Findings: The paper provides empirical insights into how to solve a system of absolute value equations. Originality/value: This paper fulfills an identified need to study absolute value equations. [ABSTRACT FROM AUTHOR]

In this paper, we propose a modified spectral conjugate gradient (MSCG) method for solving absolute value equations associated with second-order cones (SOCAVEs). Some properties of the SOCAVEs are analyzed, and the global convergence of the MSCG method is discussed in depth. Numerical experiments are given to illustrate the effectiveness and competitiveness of our algorithm. [ABSTRACT FROM AUTHOR]

Newton-type methods have been successfully applied to solve the absolute value equation Ax − |x| = b (denoted by AVE). This class of methods usually solves a system of linear equations exactly in each iteration. However, for large-scale AVEs, solving the corresponding system exactly may be expensive. In this paper, we propose an inexact Newton-type method for solving the AVE. In each iteration, the proposed method solves the corresponding system only approximately. Moreover, it adopts a new line search technique, which is well-defined and easy to implement. We prove that the proposed method has global and local superlinear convergence under the condition that the interval matrix [A − I, A + I] is regular. This condition is much weaker than those used in some Newton-type methods. Numerical results show that our method has fairly good practical efficiency for solving large-scale AVEs. [ABSTRACT FROM AUTHOR]