A Fast Reordering Algorithm for Parallel Sparse Triangular Solution (Q3991056)
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: A Fast Reordering Algorithm for Parallel Sparse Triangular Solution |
scientific article; zbMATH DE number 36281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Reordering Algorithm for Parallel Sparse Triangular Solution |
scientific article; zbMATH DE number 36281 |
Statements
A Fast Reordering Algorithm for Parallel Sparse Triangular Solution (English)
0 references
28 June 1992
0 references
directed acyclic graph
0 references
elimination tree
0 references
massively parallel computers
0 references
reordering algorithm
0 references
sparse Cholesky factorization
0 references
sparse triangular systems
0 references
transitive reduction
0 references
0.93105185
0 references
0.9237226
0 references
0.9130974
0 references
0.91177475
0 references
0.90599895
0 references
0.89955926
0 references
0 references
