Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297)
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: Fast algorithms for placing large entries along the diagonal of a sparse matrix |
scientific article; zbMATH DE number 5798197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for placing large entries along the diagonal of a sparse matrix |
scientific article; zbMATH DE number 5798197 |
Statements
Fast algorithms for placing large entries along the diagonal of a sparse matrix (English)
0 references
11 October 2010
0 references
sparse matrix algorithms
0 references
pre ordering sparse matrix
0 references
diagonally dominant sparse matrix
0 references
weighted matching algorithms
0 references
bipartite matching
0 references
combinatorial optimization
0 references
