1. Algorithm 837: AMD, an approximate minimum degree ordering algorithm
- Author
-
Amestoy, Patrick R., Enseeiht-Irit, Davis, Timothy A., and Duff, Iain S.
- Subjects
Computer programming ,Algorithm ,Computer programming ,Algorithms - 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. Categories and Subject Descriptors: G.1.3 [Numerical Analysis]: Numerical Linear Algebra--Linear systems (direct and iterative methods); sparse structural, and very large systems (direct and iterative methods); G.4 [Mathematics of Computing]: Mathematical Software--Algorithm design and analysis; efficiency General Terms: Algorithms, Experimentation, Performance Additional Key Words and Phrases: Linear equations, minimum degree, ordering methods, sparse matrices
- Published
- 2004