A Fast Reordering Algorithm for Parallel Sparse Triangular Solution (Q3991056): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Reordering Algorithm for Parallel Sparse Triangular Solution |
scientific article |
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
