Answers are grounded in this paper and cite their sources.
Presented is an algorithm which for each A, B ∈ Rn×n and b ∈ Rn in a finite numberof 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).
No takes yet. Share an insight, caveat, or question.
Jǐŕı Rohn (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: