Direct solution of piecewise linear systems

From MaRDI portal
Publication:264576

DOI10.1016/J.TCS.2016.02.009zbMATH Open1336.68144arXiv1611.09643OpenAlexW2282423341MaRDI QIDQ264576FDOQ264576


Authors: Manuel Radons Edit this on Wikidata


Publication date: 31 March 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: Let S be a real nimesn matrix, z,hatcinmathbbRn, and |z| the componentwise modulus of z. Then the piecewise linear equation system z-S| z| = hat c is called an extit{absolute value equation} (AVE). It has been proven to be equivalent to the general extit{linear complementarity problem}, which means that it is NP hard in general. We will show that for several system classes 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 the same operations count as the classical Gaussian elimination with symmetric 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.


Full work available at URL: https://arxiv.org/abs/1611.09643




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Direct solution of piecewise linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264576)