Stopping Criteria for Iterative Solvers
- 1 January 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (1) , 138-144
- https://doi.org/10.1137/0613012
Abstract
This paper shows how a theory for backward error analysis can be used to derive a family of stopping criteria for iterative methods and considers particular members of this family. Some theoretical justification is given for why these methods should work well and experimental evidence is presented to justify these claims.Keywords
This publication has 7 references indexed in Scilit:
- A Block Projection Method for Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1992
- Solving Sparse Linear Systems with Sparse Backward ErrorSIAM Journal on Matrix Analysis and Applications, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Block-iterative methods for consistent and inconsistent linear equationsNumerische Mathematik, 1980
- Iterative refinement implies numerical stability for Gaussian eliminationMathematics of Computation, 1980
- Scaling for Numerical Stability in Gaussian EliminationJournal of the ACM, 1979
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sidesNumerische Mathematik, 1964