A collection of examples where Neville elimination outperforms Gaussian elimination
From MaRDI portal
Publication:984263
Recommendations
- Gaussian elimination is not optimal, revisited
- Iterative refinement for Neville elimination
- A new pivoting strategy for Gaussian elimination
- Neville elimination for rank-structured matrices
- Variations on the Theme of Gaussian Elimination
- Gaussian elimination with pivoting on hypercubes
- A Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable
- An observation on Gauss elimination
- scientific article; zbMATH DE number 878831
- Neville elimination: An efficient algorithm with application to chemistry
Cites work
- scientific article; zbMATH DE number 1246244 (Why is no real title available?)
- scientific article; zbMATH DE number 1113632 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 3248502 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- A matricial description of Neville elimination with applications to total positivity
- A stable test for strict sign regularity
- Algorithm 694
- Almost strictly totally positive matrices
- Backward error analysis of Neville elimination
- Blocking Neville elimination algorithm for exploiting cache memories
- Gaussian Elimination with Partial Pivoting Can Fail in Practice
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Iterative Refinement in Floating Point
- Iterative refinement for Neville elimination
- Large Growth Factors in Gaussian Elimination with Pivoting
- Progressive iterative approximation and bases with the fastest convergence rates
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- Scaling for Numerical Stability in Gaussian Elimination
- Shape preserving representations in computer aided geometric design
- Sign regular matrices and Neville elimination
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Total positivity and Neville elimination
- Totally positive matrices
Cited in
(7)- Structured backward error analysis for sparse polynomial eigenvalue problems
- Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting
- Increasing data locality and introducing level-3 BLAS in the neville elimination
- A note on matrices with maximal growth factor for Neville elimination
- Tests for the recognition of total positivity
- Development of block and partitioned Neville elimination
- Neville elimination: An efficient algorithm with application to chemistry
This page was built for publication: A collection of examples where Neville elimination outperforms Gaussian elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984263)