On the stability of Gauss-Jordan elimination with pivoting
From MaRDI portal
Publication:4080643
Cited in
(17)- On the stability of the cyclic reduction without back substitution for tridiagonal systems
- On the backward stability of Gauss-Jordan elimination
- Parallel algorithms for solving large linear systems
- Forward error analysis of Gaussian elimination. II: Stability theorems
- Parallel direct methods for solving banded linear systems
- Stability of the Gauss-Huard algorithm with partial pivoting
- Clustered Gauss-Huard algorithm for the solution of \(Ax = b\)
- Growth factor and expected growth factor of some pivoting strategies
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Numerical study of some feasible direction methods in mathematical programming
- An estimate for the spectral norm of the inverse of a matrix with the Gauss-Jordan algorithm
- Rounding errors in numerical solutions of two linear equations in two unknowns
- A multi-GPU implementation of a full-field crystal plasticity solver for efficient modeling of high-resolution microstructures
- Rehabilitation of the Gauss-Jordan algorithm
- Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)
- The explicit formula for Gauss-Jordan elimination applied to flexible systems
- The Gauss-Huard algorithm and LU factorization
This page was built for publication: On the stability of Gauss-Jordan elimination with pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4080643)