On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations (Q5317648): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114073909, #quickstatements; #temporary_batch_1708557319324 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: METIS / rank | |||
Normal rank | |||
Revision as of 06:44, 28 February 2024
scientific article; zbMATH DE number 2206325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations |
scientific article; zbMATH DE number 2206325 |
Statements
On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations (English)
0 references
19 September 2005
0 references
elimination tree
0 references
Jess-Kees algorithm
0 references
minimum completion cost
0 references
parallel Cholesky factorization
0 references
numerical examples
0 references
comparison of methods
0 references
parallel computation
0 references
fill-preserving sparse matrix
0 references
