Iterative Refinement Implies Numerical Stability for Gaussian Elimination

Direct numerical methods for linear systems and matrix inversion (65F05) Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites work

scientific article; zbMATH DE number 3744404 (Why is no real title available?)
scientific article; zbMATH DE number 3473182 (Why is no real title available?)
scientific article; zbMATH DE number 3562346 (Why is no real title available?)
scientific article; zbMATH DE number 1024452 (Why is no real title available?)
scientific article; zbMATH DE number 3248502 (Why is no real title available?)
scientific article; zbMATH DE number 3362867 (Why is no real title available?)
Absolute and monotonic norms
Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
Iterative refinement implies numerical stability
On the stability of finite numerical procedures
Optimally scaled matrices
Scaling for Numerical Stability in Gaussian Elimination

Cited in

(44)

Block elimination with one refinement solves bordered linear systems accurately
On a quality measure for interval inclusions
Chebyshev acceleration of iterative refinement
Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
Average condition number for solving linear equations
An exponential approach to highly ill-conditioned linear systems
Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
The Padé method for computing the matrix exponential
Survey on the technique of hierarchical matrices
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
Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems
Improved SOR method with orderings and direct methods
Error estimation in preconditioned conjugate gradients
Wilkinson's iterative refinement of solution with automatic step-size control for linear system of equations
Ill-conditioned matrices and the integration of stiff ODEs
A collection of examples where Neville elimination outperforms Gaussian elimination
A new iterative refinement with roundoff error analysis.
Combining sparse approximate factorizations with mixed-precision iterative refinement
A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
The block decomposition of a Vandermonde matrix and its applications
Structured perturbations and symmetric matrices
Acceleration of iterative refinement for singular value decomposition
On the augmented system approach to sparse least-squares problems
Verified numerical computations for large-scale linear systems.
Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix
Stability analysis of a general Toeplitz system solver
Estimation of the sensitivity of linear and nonlinear algebraic problems
Gaussian elimination: When is scaling beneficial!
Accelerating scientific computations with mixed precision algorithms
Overestimations in bounding solutions of perturbed linear equations
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
Perturbation theory and backward error for $AX - XB = C$
Entrywise relative perturbation theory for nonsingular $M$-matrices and applications
Random matrices generating large growth in LU factorization with pivoting
Component-wise perturbation analysis and error bounds for linear least squares solutions
Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems
Neville elimination: An efficient algorithm with application to chemistry
Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
Iterative refinement enhances the stability of $QR$ factorization methods for solving linear equations

This page was built for publication: Iterative Refinement Implies Numerical Stability for Gaussian Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883373)