Scalability of Neville elimination using checkerboard partitioning
DOI10.1080/00207160601167078zbMATH Open1137.65015DBLPjournals/ijcm/AlonsoCDR08OpenAlexW2099632489WikidataQ62618257 ScholiaQ62618257MaRDI QIDQ5459720FDOQ5459720
Authors: Pedro Alonso, Raquel Cortina, 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
Recommendations
- Analyzing scalability of Neville elimination
- Parallel Processing and Applied Mathematics
- Neville elimination: a study of the efficiency using checkerboard partitioning
- A study of average-case speedup and scalability of parallel computations on static networks
- Parallel Processing and Applied Mathematics
performancealgorithmsparallel computationNeville eliminationisoefficiency functioncheckerboard partitioningscaled efficiency
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Total positivity and Neville elimination
- A matricial description of Neville elimination with applications to total positivity
- Analyzing scalability of Neville elimination
- Title not available (Why is that?)
- A study of the performance of Neville elimination using two kinds of partitioning techniques
- Neville elimination: a study of the efficiency using checkerboard partitioning
- Some aspects about the scalability of scientific applications on parallel architectures
Cited In (4)
This page was built for publication: Scalability of Neville elimination using checkerboard partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459720)
