Componentwise condition numbers of random sparse matrices
classification
🧮 math.NA
math.PR
keywords
componentwiseconditionrandomsparseaccuracyaverageboundbounds
read the original abstract
We prove an 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 x n matrix. As a consequence, small bounds on the average loss of accuracy for triangular linear systems follow.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.