Iterative Refinement Implies Numerical Stability for Gaussian Elimination
From MaRDI portal
Publication:3883373
DOI10.2307/2006197zbMath0441.65027OpenAlexW4243191012MaRDI QIDQ3883373
Publication date: 1980
Full work available at URL: https://doi.org/10.2307/2006197
Gaussian eliminationnumerical stabilityroundoff error analysisbackward error analysispivotingiterative refinementscaling problems
Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (42)
Survey on the technique of hierarchical matrices ⋮ Average condition number for solving linear equations ⋮ Mixed precision algorithms in numerical linear algebra ⋮ A new iterative refinement with roundoff error analysis ⋮ Perturbation theory and backward error for \(AX - XB = C\) ⋮ Iterative refinement for ill-conditioned linear systems ⋮ An effective predictor-corrector process for large scale linear system of equations ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ Stability analysis of a general Toeplitz system solver ⋮ Entrywise relative perturbation theory for nonsingular \(M\)-matrices and applications ⋮ Overestimations in bounding solutions of perturbed linear equations ⋮ 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 ⋮ The Padé method for computing the matrix exponential ⋮ Verified numerical computations for large-scale linear systems. ⋮ On the augmented system approach to sparse least-squares problems ⋮ Chebyshev acceleration of iterative refinement ⋮ Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning ⋮ An exponential approach to highly ill-conditioned linear systems ⋮ A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems ⋮ Acceleration of iterative refinement for singular value decomposition ⋮ Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions ⋮ The block decomposition of a Vandermonde matrix and its applications ⋮ Block elimination with one refinement solves bordered linear systems accurately ⋮ Neville elimination: An efficient algorithm with application to chemistry ⋮ Estimation of the sensitivity of linear and nonlinear algebraic problems ⋮ Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations ⋮ Gaussian elimination: When is scaling beneficial! ⋮ Random Matrices Generating Large Growth in LU Factorization with Pivoting ⋮ Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems ⋮ Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix ⋮ Error estimation in preconditioned conjugate gradients ⋮ Accelerating scientific computations with mixed precision algorithms ⋮ A collection of examples where Neville elimination outperforms Gaussian elimination ⋮ 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 ⋮ Improved SOR method with orderings and direct methods ⋮ Structured perturbations and symmetric matrices ⋮ Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation ⋮ Component-wise perturbation analysis and error bounds for linear least squares solutions ⋮ Ill-conditioned matrices and the integration of stiff ODEs ⋮ Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
Cites Work
- Optimally scaled matrices
- Absolute and monotonic norms
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Scaling for Numerical Stability in Gaussian Elimination
- Iterative refinement implies numerical stability
- On the stability of finite numerical procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Iterative Refinement Implies Numerical Stability for Gaussian Elimination
