Iterative refinement for Neville elimination
From MaRDI portal
Publication:3603609
DOI10.1080/00207160802044134zbMath1159.65029OpenAlexW2030967755MaRDI QIDQ3603609
Pedro Alonso, Jorge Delgado, Rafael Gallego, Juan Manuel Peña
Publication date: 18 February 2009
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802044134
Positive matrices and their generalizations; cones of matrices (15B48) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Growth factors of pivoting strategies associated with Neville elimination, Neville elimination: An efficient algorithm with application to chemistry, Accurate Computations and Applications of Some Classes of Matrices, A collection of examples where Neville elimination outperforms Gaussian elimination, Algorithmic characterization of pentadiagonal ASSR matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Backward error analysis of Neville elimination
- Neville elimination: a study of the efficiency using checkerboard partitioning
- Progressive iterative approximation and bases with the fastest convergence rates
- Totally positive bases and progressive iteration approximation
- Total positivity and Neville elimination
- Backward error analysis for totally positive linear systems
- A matricial description of Neville elimination with applications to total positivity
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Totally positive matrices