Minimum communication cost reordering for parallel sparse Cholesky factorization (Q1960600)
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: Minimum communication cost reordering for parallel sparse Cholesky factorization |
scientific article; zbMATH DE number 1387487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum communication cost reordering for parallel sparse Cholesky factorization |
scientific article; zbMATH DE number 1387487 |
Statements
Minimum communication cost reordering for parallel sparse Cholesky factorization (English)
0 references
12 January 2000
0 references
communication cost
0 references
distributed-memory multiprocessor
0 references
sparse matrix
0 references
parallel factorization
0 references
equivalent reordering
0 references
elimination tree
0 references
