Abstract
We prove an ${\cal O}(\log n)$ bound for the expected value of the logarithm of the componentwise (and, a fortiori, the mixed) condition number of a random sparse $n\times n$ matrix. As a consequence, small bounds on the average loss of accuracy for triangular linear systems follow.
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.
