Fast Computation of Minimal Fill Inside A Given Elimination Ordering (Q3642841)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Computation of Minimal Fill Inside A Given Elimination Ordering |
scientific article |
Statements
Fast Computation of Minimal Fill Inside A Given Elimination Ordering (English)
0 references
6 November 2009
0 references
sparse matrix computations
0 references
minimal fill
0 references
elimination trees
0 references
composite tree rotations
0 references
maximum cardinality search (MCS)
0 references
minimal triangulation
0 references
