Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices (Q3537453)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5363091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices |
scientific article; zbMATH DE number 5363091 |
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
