Block-Cholesky for parallel processing (Q1188310)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Block-Cholesky for parallel processing |
scientific article; zbMATH DE number 40463
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Block-Cholesky for parallel processing |
scientific article; zbMATH DE number 40463 |
Statements
Block-Cholesky for parallel processing (English)
0 references
13 August 1992
0 references
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.
0 references
parallel processing
0 references
numerical results
0 references
Cholesky factorization
0 references
blocked algorithm
0 references
Level 3 Basic Linear Algebra Subroutines (BLAS)
0 references
SCHEDULE package
0 references