An efficient and scalable block parallel algorithm of Neville elimination as a tool for the CMB maps problem
DOI10.1007/s10910-010-9769-0zbMath1310.65031OpenAlexW2027714262WikidataQ62618215 ScholiaQ62618215MaRDI QIDQ431966
Raquel Cortina, Pedro Alonso, José Ranilla, Antonio M. Vidal
Publication date: 3 July 2012
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-010-9769-0
numerical exampleefficiencyscalabilityNeville eliminationcosmic microwave backgroundexecution timeblock parallel algorithms
Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (2)
Cites Work
- Totally positive bases and progressive iteration approximation
- Analyzing scalability of Neville elimination
- Blocking Neville elimination algorithm for exploiting cache memories
- Total positivity and Neville elimination
- Neville elimination for rank-structured matrices
- Scalability of Neville elimination using checkerboard partitioning
- Totally positive matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient and scalable block parallel algorithm of Neville elimination as a tool for the CMB maps problem