Communication-optimal Parallel and Sequential Cholesky Decomposition (Q5200261): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ScaLAPACK / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3103849684 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0902.2537 / rank | |||
Normal rank | |||
Latest revision as of 23:48, 19 April 2024
scientific article; zbMATH DE number 5934730
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communication-optimal Parallel and Sequential Cholesky Decomposition |
scientific article; zbMATH DE number 5934730 |
Statements
Communication-optimal Parallel and Sequential Cholesky Decomposition (English)
0 references
1 August 2011
0 references
Cholesky decomposition
0 references
communication avoiding algorithm
0 references
bandwidth lower bound
0 references
latency
0 references
LU factorization
0 references
QR factorization
0 references
parallel computation
0 references
matrix multiplication
0 references
communication costs
0 references
