The Minimum Degree Ordering with Constraints (Q4733299)
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: Publication:4733299 |
scientific article; zbMATH DE number 4119492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Minimum Degree Ordering with Constraints |
scientific article; zbMATH DE number 4119492 |
Statements
The Minimum Degree Ordering with Constraints (English)
0 references
1989
0 references
symmetric sparse matrices
0 references
reordering
0 references
Gaussian elimination
0 references
constrained minimum degree ordering scheme
0 references
sensitivity
0 references
matrix ordering
0 references
minimum degree algorithm
0 references
parallel elimination
0 references
0.8376970887184143
0 references
0.8324156403541565
0 references
0.8218922019004822
0 references
0.8178884387016296
0 references
0.8174706697463989
0 references
