In this paper, we investigate the NP-hard absolute value equations (AVE) Ax − |x| = b and establish two computational enclosures for the solution of AVE. The condition for enclosing the solution and guaranteeing the existence of solutions of AVE is presented in a given domain. Based on this condition, new algorithms are designed to compute an interval to enclose the unknown solution of AVE. Numerical results are reported to support the theoretical analysis in the paper.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados