The multiple minimum degree ordering with greedy graph compression for vector computers (Q2738666)
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: The multiple minimum degree ordering with greedy graph compression for vector computers |
scientific article; zbMATH DE number 1639798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The multiple minimum degree ordering with greedy graph compression for vector computers |
scientific article; zbMATH DE number 1639798 |
Statements
10 March 2002
0 references
numerical examples
0 references
algorithms
0 references
large sparse symmetric positive definite systems
0 references
matrix reordering
0 references
symbolic factorization
0 references
performance
0 references
The multiple minimum degree ordering with greedy graph compression for vector computers (English)
0 references
0.8052744269371033
0 references