Algorithm 836
Published in ACM Transactions on Mathematical Software • Sep 1, 2004
Authors:,,
Timothy A. Davis
John R. Gilbert
Stefan I. Larimore
Abstract
Two codes are discussed, COLAMD and SYMAMD, that compute approximate minimum degree orderings for sparse matrices in two contexts: (1) sparse partial pivoting, which requires a sparsity preserving column pre-ordering prior to numerical factorization, and (2) sparse Cholesky factorization, which requ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!