A collection of examples where Neville elimination outperforms Gaussian elimination
From MaRDI portal
Publication:984263
DOI10.1016/J.AMC.2010.03.094zbMATH Open1196.65062OpenAlexW2096499832MaRDI QIDQ984263FDOQ984263
J. M. Peña, Pedro Alonso, Rafael Gallego, J. Delgado
Publication date: 19 July 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.094
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
Gaussian eliminationnumerical examplesstabilityNeville eliminationtotally positive matricesiterative refinement
Cites Work
- Algorithm 694
- Totally positive matrices
- Total positivity and Neville elimination
- A matricial description of Neville elimination with applications to total positivity
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Title not available (Why is that?)
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Title not available (Why is that?)
- A stable test for strict sign regularity
- Title not available (Why is that?)
- Sign regular matrices and Neville elimination
- Shape preserving representations in computer aided geometric design
- Title not available (Why is that?)
- Gaussian Elimination with Partial Pivoting Can Fail in Practice
- Large Growth Factors in Gaussian Elimination with Pivoting
- A Collection of Problems for Which Gaussian Elimination with Partial Pivoting is Unstable
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- Almost strictly totally positive matrices
- Blocking Neville elimination algorithm for exploiting cache memories
- Backward error analysis of Neville elimination
- Progressive iterative approximation and bases with the fastest convergence rates
- Scaling for Numerical Stability in Gaussian Elimination
- Iterative Refinement in Floating Point
- Iterative refinement for Neville elimination
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- Title not available (Why is that?)
Cited In (7)
- Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting
- A note on matrices with maximal growth factor for Neville elimination
- Increasing data locality and introducing level-3 BLAS in the neville elimination
- Structured backward error analysis for sparse polynomial eigenvalue problems
- Development of block and partitioned Neville elimination
- Tests for the recognition of total positivity
- Neville elimination: An efficient algorithm with application to chemistry
Uses Software
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)
