Answers are grounded in this paper and cite their sources.
AMD is a set of routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions written in both C and Fortran 77. A MATLAB interface is included.
No takes yet. Share an insight, caveat, or question.
Amestoy et al. (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: