Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
Authors:
Preprint
Abstract
Let $\orig{A}$ be any matrix and let $A$ be a slight random perturbation of $\orig{A}$. We prove that it is unlikely that $A$ has large condition number. Using this result, we prove it is unlikely that $A$ has large growth factor under Gaussian elimination without pivoting. By combining these results, we bound the smoothed precision needed by Gaussian elimination without pivoting. Our results improve the average-case analysis of Gaussian elimination without pivoting performed by Yeung and Chan (SIAM J. Matrix Anal. Appl., 1997).
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- The Expected Norm of Random MatricesCombinatorics, Probability and Computing, 2000
- Probabilistic Analysis of Gaussian Elimination Without PivotingSIAM Journal on Matrix Analysis and Applications, 1997
- Complexity theory and numerical analysisActa Numerica, 1997
- Applied Numerical Linear Algebra1997
- Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingSIAM Journal on Optimization, 1995
- Average-Case Stability of Gaussian EliminationSIAM Journal on Matrix Analysis and Applications, 1990
- Geometric Algorithms and Combinatorial OptimizationJournal of the Operational Research Society, 1989
- Eigenvalues and Condition Numbers of Random MatricesSIAM Journal on Matrix Analysis and Applications, 1988
- Error Analysis of Direct Methods of Matrix InversionJournal of the ACM, 1961