Abstract
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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
