Efficient and optimal parallel algorithms for Cholesky decomposition

DOI10.1023/B:JMMA.0000015832.41014.EDzbMath1047.65017OpenAlexW2019381549MaRDI QIDQ1430222

Eunice E. Santos, Pei-Yue Chu

Publication date: 27 May 2004

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jmma.0000015832.41014.ed

zbMATH Keywords

performancealgorithmsnumerical examplesparallel complexityCholesky decompositionLogP model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Parallel numerical computation (65Y05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

This page was built for publication: Efficient and optimal parallel algorithms for Cholesky decomposition