A Survey of Condition Number Estimation for Triangular Matrices
- 1 December 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 29 (4) , 575-596
- https://doi.org/10.1137/1029112
Abstract
We survey and compare a wide variety of techniques for estimating the condition number of a triangular matrix, and make recommendations concerning the use of the estimates in applications. Each of the methods is shown to bound the condition number; the bounds can broadly be categorised as upper bounds from matrix theory and lower bounds from heuristic or probabilistic algorithms. For each bound we examine by how much, at worst, it can overestimate or underestimate the condition number. Numerical experiments are presented in order to illustrate and compare the practical performance of the condition estimatorsKeywords
This publication has 30 references indexed in Scilit:
- A LINPACK-style condition estimator for the equationAX-XB^{T} = CIEEE Transactions on Automatic Control, 1984
- A trust-region approach to linearly constrained optimizationPublished by Springer Nature ,1984
- A Set of Counter-Examples to Three Condition Number EstimatorsSIAM Journal on Scientific and Statistical Computing, 1983
- Estimating Extremal Eigenvalues and Condition Numbers of MatricesSIAM Journal on Numerical Analysis, 1983
- On matrix majorants and minorants, with applications to differential equationsLinear Algebra and its Applications, 1983
- Generalizing the LINPACK condition estimatorPublished by Springer Nature ,1982
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- On computing bounds for the least singular value of a triangular matrixBIT Numerical Mathematics, 1975
- Some Condition-Number bounds for the Gaussian Elimination ProcessIMA Journal of Applied Mathematics, 1973