Scalability of Neville elimination using checkerboard partitioning

DOI10.1080/00207160601167078zbMath1137.65015OpenAlexW2099632489WikidataQ62618257 ScholiaQ62618257MaRDI QIDQ5459720

Raquel Cortina, Pedro Alonso, Irene Díaz, José Ranilla

Publication date: 29 April 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160601167078

zbMATH Keywords

performancealgorithmsparallel computationNeville eliminationisoefficiency functioncheckerboard partitioningscaled efficiency

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

An efficient and scalable block parallel algorithm of Neville elimination as a tool for the CMB maps problem ⋮ Algorithmic characterization of pentadiagonal ASSR matrices

Cites Work

• Neville elimination: a study of the efficiency using checkerboard partitioning
• Analyzing scalability of Neville elimination
• Total positivity and Neville elimination
• A matricial description of Neville elimination with applications to total positivity
• Some aspects about the scalability of scientific applications on parallel architectures
• A study of the performance of Neville elimination using two kinds of partitioning techniques
• Unnamed Item

This page was built for publication: Scalability of Neville elimination using checkerboard partitioning