Algorithm 837

Patrick Amestoy, Timothy A. Davis, Iain Duff · ACM Transactions on Mathematical Software · 2004

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.

Cited by 311 works. doi:10.1145/1024074.1024081

Authors

References