Iterative refinement implies numerical stability
From MaRDI portal
Cites work
Cited in
(27)- Block elimination with one refinement solves bordered linear systems accurately
- Mixed precision algorithms in numerical linear algebra
- Iterative refinement for ill-conditioned linear systems
- An effective predictor-corrector process for large scale linear system of equations
- Note on predictor-corrector process for ill-conditioned linear system of equations
- Wilkinson's iterative refinement of solution with automatic step-size control for linear system of equations
- Iterative refinement of computing inverse matrix
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Acceleration of iterative refinement for singular value decomposition
- The simplex method is not always well behaved
- Stability analysis of a general Toeplitz system solver
- Round-off error analysis of iterations for large linear systems
- Rank-k modification methods for recursive least squares problems
- Bordered augmented linear systems in numerical continuation and bifurcation
- A note on Wilkinson's iterative refinement of solution with automatic step-size control
- Extended version with the analysis of dynamic system for iterative refinement of solution
- Stability analysis of the method of seminormal equations for linear least squares problems
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Random matrices generating large growth in LU factorization with pivoting
- A mixed precision Jacobi SVD algorithm
- Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- A recursive algorithm for the incomplete partial fraction decomposition
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Roundoff-error analysis of a new class of conjugate-gradient algorithms
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- The accurate solution of certain continuous problems using only single precision arithmetic
This page was built for publication: Iterative refinement implies numerical stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4148893)
