CAMD: constrained approximate minimum degree ordering

CAMD is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting). There are versions in both C and Fortran. A MATLAB interface is provided.

Copyright, and License:

Copyright (c) 2004-2012 by Timothy A. Davis, Patrick R. Amestoy, Iain S. Duff, and Yanqing Chen. All Rights Reserved. Distributed under the GNU LGPL license.

Availability:

• Download the current version of CAMD itself here.
• Browse the source code.
• Requires the SuiteSparse_config package.
• Get all of SuiteSparse here.

Versions:

• CAMD-2.3.1.tar.gz (current version)
• CAMD-2.3.0.tar.gz
• CAMD-2.2.4.tar.gz
• CAMD-2.2.3.tar.gz
• CAMD-2.2.2.tar.gz
• CAMD-2.2.1.tar.gz
• CAMD-2.2.0.tar.gz
• CAMD-2.1.2.tar.gz
• CAMD-2.1.1.tar.gz
• CAMD-2.1.0.tar.gz

References (please cite these when using this software):

• Algorithm 837: AMD, An approximate minimum degree ordering algorithm, P. Amestoy, T. A. Davis, and I. S. Duff, ACM Transactions on Mathematical Software, vol 30, no. 3, Sept. 2004, pp. 381-388.
• An approximate minimum degree ordering algorithm, P. Amestoy, T. A. Davis, and I. S. Duff, SIAM Journal on Matrix Analysis and Applications, vol 17, no. 4, pp. 886-905, Dec. 1996.