An algorithm for solving the absolute value equation

By Jiri Rohn. 2009

104 citations recorded by the source corpus.

Presented is an algorithm which for each A,B ∈ Rn×n and b ∈ Rn in a finite number of steps either finds a solution of the equation Ax+B|x| = b, or states existence of a singular matrix S satisfying |S − A |≤| B| (and in most cases also constructs such an S).

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/574c17273d8d59cf5bdb0331513b802235f2ed11

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Cheng’en Yu
2. Jein-Shan Chen
3. Barintag Saheya

Citations in the corpus

• Numerical comparisons based on four smoothing functions for absolute value equation (2018, background): “It is known that the AVE (1) was first introduced by Rohn in [20] and recently has been investigated by many researchers, for example, Hu and Huang [8], Jiang and Zhang [9], Ketabchi and Moosaei [10], Mangasarian [11–15], Mangasarian and Meyer [16], Prokopyev [17], and Rohn [22].”