Computer Science – Numerical Analysis
Scientific paper
2003-10-12
Computer Science
Numerical Analysis
corrected some minor mistakes
Scientific paper
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).
Sankar Arvind
Spielman Daniel A.
Teng Shang-Hua
No associations
LandOfFree
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-229695