Incremental Condition Estimation for Sparse Matrices
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 11 (4) , 644-659
- https://doi.org/10.1137/0611047
Abstract
Incremental condition estimation provides an estimate for the smallest singular value of a triangular matrix. In particular, it gives a running estimate of the smallest singular value of a triangular factor matrix as the factor is generated one column or row at a time. An incremental condition estimator for dense matrices was originally suggested by Bischof. In this paper this scheme is generalized to handle sparse triangular matrices, especially those that are factors of sparse matrices. Numerical experiments on a variety of matrices demonstrate the reliability of this scheme in estimating the smallest singular value. A partial description of its implementation in a sparse matrix factorization code further illustrates its practicality.Keywords
This publication has 14 references indexed in Scilit:
- Incremental Condition EstimationSIAM Journal on Matrix Analysis and Applications, 1990
- Efficient Algorithms for Computing the Condition Number of a Tridiagonal MatrixSIAM Journal on Scientific and Statistical Computing, 1986
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982
- Generalizing the LINPACK condition estimatorPublished by Springer Nature ,1982
- Condition Number Estimation for Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1981
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- Updating the singular value decompositionNumerische Mathematik, 1978
- Rank-one modification of the symmetric eigenproblemNumerische Mathematik, 1978
- Some Modified Matrix Eigenvalue ProblemsSIAM Review, 1973