Algorithm 837: AMD, an approximate minimum degree ordering algorithm Academic Article uri icon

abstract

  • 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.

published proceedings

  • ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

author list (cited authors)

  • Amestoy, P. R., Enseeiht-Irit, .., Davis, T. A., & Duff, I. S.

complete list of authors

  • Amestoy, PR||Davis, TA||Duff, IS

publication date

  • January 1, 2004 11:11 AM