Node Selection Strategies for Bottom-Up Sparse Matrix Ordering (Q4389099)
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: Node Selection Strategies for Bottom-Up Sparse Matrix Ordering |
scientific article; zbMATH DE number 1151000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Node Selection Strategies for Bottom-Up Sparse Matrix Ordering |
scientific article; zbMATH DE number 1151000 |
Statements
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering (English)
0 references
11 May 1998
0 references
sparse matrices
0 references
ordering algorithms
0 references
minimum degree
0 references
minimum local fill
0 references
minimum deficiency
0 references
graph algorithms
0 references
node selection
0 references
factorization
0 references
0.8456778526306152
0 references
0.8352954387664795
0 references
0.8343852758407593
0 references
0.8333877325057983
0 references
