Performance of parallel Cholesky factorization algorithms using BLAS
DOI10.1007/BF00155804zbMATH Open1187.65155MaRDI QIDQ973431FDOQ973431
Authors: Glenn R. Luecke, Jae Heon Yun, Philip W. Smith
Publication date: 31 May 2010
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Parallel algorithms in computer science (68W10) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
Cited In (7)
- PoLAPACK: Parallel factorization routines with algorithmic blocking
- Scaling LAPACK panel operations using parallel cache assignment
- A fully portable high performance minimal storage hybrid format Cholesky algorithm
- Level-3 Cholesky factorization routines improve performance of many Cholesky algorithms
- The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
- Title not available (Why is that?)
- Near optimal Cholesky factorization on orthogonal multiprocessors.
Uses Software
This page was built for publication: Performance of parallel Cholesky factorization algorithms using BLAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973431)