On algorithms for permuting large entries to the diagonal of a sparse matrix (Q2706301)
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: On algorithms for permuting large entries to the diagonal of a sparse matrix |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On algorithms for permuting large entries to the diagonal of a sparse matrix |
scientific article |
Statements
19 March 2001
0 references
sparse matrices
0 references
bipartite weighted matching
0 references
preconditioning
0 references
On algorithms for permuting large entries to the diagonal of a sparse matrix (English)
0 references
The authors show how bipartite matching algorithms can be used to permute the rows and columns of a matrix so that the diagonal of the permuted matrix is large. The proposed algorithm computes a matching that corresponds to a permutation of a sparse matrix such that the product (or sum) of the diagonal entries is maximized. The authors consider a modified version of this algorithm to compute a permutation that maximizes the smallest diagonal entry. They also investigate the influence of scaling the matrix. Results of some computational experiments are also given.
0 references
