Iterative refinement implies numerical stability
From MaRDI portal
Publication:4148893
DOI10.1007/BF01932150zbMath0372.65012OpenAlexW2078126355MaRDI QIDQ4148893
No author found.
Publication date: 1977
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01932150
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (25)
Mixed precision algorithms in numerical linear algebra ⋮ Rank-\(k\) modification methods for recursive least squares problems ⋮ The accurate solution of certain continuous problems using only single precision arithmetic ⋮ A recursive algorithm for the incomplete partial fraction decomposition ⋮ Iterative refinement for ill-conditioned linear systems ⋮ Iterative Refinement Implies Numerical Stability for Gaussian Elimination ⋮ An effective predictor-corrector process for large scale linear system of equations ⋮ Stability analysis of a general Toeplitz system solver ⋮ The simplex method is not always well behaved ⋮ Note on predictor-corrector process for ill-conditioned linear system of equations ⋮ Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems ⋮ Round-off error analysis of iterations for large linear systems ⋮ Roundoff-error analysis of a new class of conjugate-gradient algorithms ⋮ Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning ⋮ Acceleration of iterative refinement for singular value decomposition ⋮ Bordered augmented linear systems in numerical continuation and bifurcation ⋮ Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions ⋮ Block elimination with one refinement solves bordered linear systems accurately ⋮ Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations ⋮ A note on Wilkinson's iterative refinement of solution with automatic step-size control ⋮ Random Matrices Generating Large Growth in LU Factorization with Pivoting ⋮ Extended version with the analysis of dynamic system for iterative refinement of solution ⋮ Iterative refinement of computing inverse matrix ⋮ Wilkinson's iterative refinement of solution with automatic step-size control for linear system of equations ⋮ Stability analysis of the method of seminormal equations for linear least squares problems
Cites Work
This page was built for publication: Iterative refinement implies numerical stability
