
doi: 10.1137/0902031
The LINPACK package of linear equation solving software provides a reliable and inexpensive algorithm for estimating the condition number of a dense matrix. The direct generalization to banded or sparse matrices is reliable, but not necessarily inexpensive. The simple modification described in this note can bring the cost of the algorithm back to a reasonable level.
LU decomposition, LINPACK subroutines, condition number estimation, sparse matrices, stability of the computation, Numerical computation of matrix norms, conditioning, scaling, scaling, triangular system, Direct numerical methods for linear systems and matrix inversion, Conditioning of matrices
LU decomposition, LINPACK subroutines, condition number estimation, sparse matrices, stability of the computation, Numerical computation of matrix norms, conditioning, scaling, scaling, triangular system, Direct numerical methods for linear systems and matrix inversion, Conditioning of matrices
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
