Iterative Refinement Implies Numerical Stability for Gaussian Elimination
Robert D. Skeel · Mathematics of Computation · 1980
Because of scaling problems, Gaussian elimination with pivoting is not always as accurate as one might reasonably expect. It is shown that even a single iteration of iterative refinement in single precision is enough to make Gaussian elimination stable in a very strong sense. Also, it is shown that without iterative refinement row pivoting is inferior to column pivoting in situations where the norm of the residual is important.
Cited by 151 works. doi:10.1090/s0025-5718-1980-0572859-4 Open-access PDF
Authors
References
- Introduction to matrix computations
- Rounding errors in algebraic processes
- Computer methods for mathematical computations
- Computer Solution of Linear Algebraic Systems
- Rounding Errors in Algebraic Processes
- C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice‐Hall, Inc. Preis geb. 54 s. net
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Optimally scaled matrices
- Absolute and monotonic norms
- Introduction to Applied Numerical Analysis.