Block-Cholesky for parallel processing

From MaRDI portal





The paper is devoted to the Cholesky factorization \(A=LL^ T\) with \(A\) a positive definite symmetric matrix and \(L\) a lower triangular matrix. A blocked algorithm based on Level 3 Basic linear Algebra Subroutines (BLAS) is presented which implements parallelism over the blocks. The amount of parallelism is studied and the data dependency graph is discussed. The SCHEDULE package is used to obtain a portable schedule of the tasks. Numerical results of the method are presented and compared with results for a block algorithm parallelized within the Level 3 BLAS kernels.





Describes a project that uses

Uses Software






This page was built for publication: Block-Cholesky for parallel processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1188310)