Stability of a pivoting strategy for parallel Gaussian elimination
From MaRDI portal
The stability of a parallel mechanism for carrying out partial pivoting is investigated. The theoretical results demonstrate that the upper bounds on the growth factor under the parallel strategy is bounded by \(3^{n-1}\), as compared to \(2^{n-1}\) for partial pivoting. There is no reason to conclude that Gaussian elimination with partial pivoting by adding will be significantly worse in practice than Gaussian elimination with partial pivoting.
Recommendations
Cited in
(8)- Stability of the Gauss-Huard algorithm with partial pivoting
- scientific article; zbMATH DE number 5872172 (Why is no real title available?)
- Analysis of Pairwise Pivoting in Gaussian Elimination
- Stability of block LU factorization for block tridiagonal block H-matrices
- Gaussian Elimination with Pivoting is P-Complete
- Simultaneous backward stability of Gauss and Gauss–Jordan elimination
- Growth factors of pivoting strategies associated with Neville elimination
- On the parallel complexity of Gaussian elimination with pivoting
This page was built for publication: Stability of a pivoting strategy for parallel Gaussian elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952352)
