On the backward stability of Gauss-Jordan elimination
From MaRDI portal
(Redirected from On the backward stability of Gauss-Jordan elimination)
The author modifies the method proposed by \textit{V. V. Voevodin} and him [A new method of round-off error estimation. Proc. Workshop on Parallel and Distributed Processing, March 1990, Sofia, 315ff. (1990)] to study backward stability of the Gauss-Jordan elimination using the graph of the algorithm and its parallel structure. An upper triangular system of linear equations of size \(n\) is considered, and it is shown that the estimates of the equivalent perturbations depend quadratically on \(n\).
Recommendations
- Simultaneous backward stability of Gauss and Gauss–Jordan elimination
- Forward error analysis of Gaussian elimination. II: Stability theorems
- A note on the stability of Gauss-Jordan elimination for diagonally dominant matrices
- Average-Case Stability of Gaussian Elimination
- scientific article; zbMATH DE number 4149447
- ON THE EXPLICIT FORMULA FOR GAUSS-JORDAN ELIMINATION
- Backward stability of iterations for computing the polar decomposition
- On the robustness of Gaussian elimination with partial pivoting
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
- A backward stable algorithm for quadratic eigenvalue problems
Cites work
Cited in
(4)
This page was built for publication: On the backward stability of Gauss-Jordan elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180348)