Neville elimination: a study of the efficiency using checkerboard partitioning
DOI10.1016/j.laa.2003.11.028zbMath1063.65023OpenAlexW2023525107WikidataQ62618264 ScholiaQ62618264MaRDI QIDQ703615
Raquel Cortina, Pedro Alonso, Irene Díaz, José Ranilla
Publication date: 11 January 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2003.11.028
Gaussian eliminationPerformanceParallel computingNeville eliminationNumerical examplesCheckerboard partitioningComparison of methodTotally positive matrices
Positive matrices and their generalizations; cones of matrices (15B48) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Backward error analysis of Neville elimination
- Complexity of dense-linear-system solution on a multiprocessor ring
- Generalized Schur-complements and a test for total positivity
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- A matricial description of Neville elimination with applications to total positivity
- Elimination techniques: From extrapolation to totally positive matrices and CAGD
- Numerical linear algebra algorithms and software
- Parallel Algorithms for Dense Linear Algebra Computations
- Average-Case Stability of Gaussian Elimination
- Numerical Linear Algebra for High-Performance Computers
- Development of block and partitioned Neville elimination
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Totally positive matrices
- A study of the performance of Neville elimination using two kinds of partitioning techniques
This page was built for publication: Neville elimination: a study of the efficiency using checkerboard partitioning