Abstract
Let S be a real n×n matrix, z,cˆ∈Rn, and |z| the componentwise modulus of z. Then the piecewise linear equation systemz−S|z|=cˆ is called an absolute value equation (AVE). It has been proven to be equivalent to the general linear complementarity problem, which means that it is NP-hard in general.We will show that for several system classes (in the sense of structural impositions on S) the AVE essentially retains the good-natured solvability properties of regular linear systems. I.e., it can be solved directly by a slightly modified Gaussian elimination that we call the signed Gaussian elimination. For dense matrices S this algorithm has, up to a term in O(n), the same operations count as the classical Gaussian elimination with column pivoting. For tridiagonal systems in n variables its computational cost is roughly that of sorting n floating point numbers. The sharpness of the proposed restrictions on S will be established.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.