Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices (Q3537453): Difference between revisions
From MaRDI portal
Latest revision as of 20:19, 27 January 2025
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices |
scientific article |
Statements
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices (English)
0 references
6 November 2008
0 references
elimination tree
0 references
sparse matrix factorization
0 references
symbolic LU factorization
0 references
symmetric reordering
0 references
0.8518614
0 references
0.83968794
0 references
0.78721243
0 references
0.7809918
0 references
0.7726451
0 references
0 references
0.7618273
0 references
0.7609747
0 references