On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices. (Q3466259)
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 6537764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices. |
scientific article; zbMATH DE number 6537764 |
Statements
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (English)
0 references
1 February 2016
0 references
sparse linear solver
0 references
symmetric indefinite systems
0 references
parallel computation
0 references
approximation algorithm
0 references
auction algorithm
0 references
matching
0 references
sparse symmetric matrix
0 references
scaling
0 references
reordering
0 references
numerical examples
0 references
Hungarian algorithm
0 references
0.7656872868537903
0 references
0.7597865462303162
0 references
0.7554870843887329
0 references
0.7506330013275146
0 references
