Algorithm 837: AMD, an approximate minimum degree ordering algorithm

Patrick R. Amestoy, Enseeiht-Irit, Timothy A. Davis, Iain S. Duff

Code and Data 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.

Article

Patrick R. Amestoy, Enseeiht-Irit, Timothy A. Davis, Iain S. Duff, et al. "Algorithm 837: AMD, an approximate minimum degree ordering algorithm." ACM Transactions on Mathematical Software.     doi:10.1145/1024074.1024081. Retrieved 12/15/2018 from researchcompendia.org/compendia/2013.376/

Compendium Type: Published Papers
Primary Research Field: Computer and Information Sciences
Secondary Research Field: Mathematics
Content License: Public Domain Mark
Code License: MIT License

Page Owner

jenn.seiler@gmail.com

created 12/23/2013

modified 01/16/2014

blog comments powered by Disqus