Introduction to the Special Section on Sparse and Structured Matrices and Their Applications
The field of sparse matrices is a broad and important area of the computational sciences that includes structured matrices and those with seemingly little or no structure. The relevance of the field ...
The field of sparse matrices is a broad and important area of the computational sciences that includes structured matrices and those with seemingly little or no structure. The relevance of the field ...
Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
Greedy algorithms for ordering sparse matrices for Cholesky factorization can be based on different metrics. Minimum degree, a popular and effective greedy ordering scheme, minimizes the number of no...
Greedy algorithms for ordering sparse matrices for Cholesky factorization can be based on different metrics. Minimum degree, a popular and effective greedy ordering scheme, minimizes the number of no...
You are not logged in to this journal. Log in
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
SIAM. J. Matrix Anal. & Appl. Volume 20, Issue 4, pp. 889-901 (1999)
Issue Date: 1999
Connotea
CiteULike
del.icio.us
BibSonomy
We consider techniques for permuting a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. We discuss various criteria for this and consider their implementation as computer codes. We then indicate several cases where such a permutation can be useful. These include the solution of sparse equations by a direct method and by an iterative technique. We also consider its use in generating a preconditioner for an iterative method. We see that the effect of these reorderings can be dramatic although the best a priori strategy is by no means clear.
©1999 Society for Industrial and Applied Mathematics| Permalink: | http://dx.doi.org/10.1137/S0895479897317661 |
KEYWORDS and AMS
65F05, 65F50
PUBLICATION DATA
0895-4798 (print)
1095-7162 (online)
SIAM