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
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Approximate Minimum Degree Ordering Algorithm
- The Evolution of the Minimum Degree Ordering Algorithm
- A column approximate minimum degree ordering algorithm
- Improving the Run Time and Quality of Nested Dissection Ordering
- Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
- Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering
- Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods