Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/1024074.1024081 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
linear equations,ordering methods,sparse matrix,numerical factorization,approximate minimum degree,matlab interface,sparse matrices,minimum degree | Linear equation,Mathematical optimization,MATLAB,Minimum degree algorithm,Permutation,Fortran,Algorithm,Theoretical computer science,Factorization,Sparse matrix,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | 0098-3500 |
Citations | PageRank | References |
88 | 5.82 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick R. Amestoy | 1 | 446 | 44.24 |
| TIMOTHY A. DAVIS | 2 | 1447 | 144.19 |
| Iain S. Duff | 3 | 1107 | 148.90 |