The DOI matches its Crossref record.
Algorithm 837: AMD, an approximate minimum degree ordering algorithm
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
SBA: A software package for generic sparse bundle adjustment
Lourakis, M. I. A., & Argyros, A. A. (2009) · ACM Transactions on Mathematical Software · doi:10.1145/1486525.1486527 · Cited by 788
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
Davis, T. A. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/992200.992205 · Cited by 419
Self-citationTree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Incremental Block Cholesky Factorization for Nonlinear Least Squares in Robotics
Polok, L., Ila, V., Solony, M., Smrz, P., & Zemcik, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.042 · Cited by 45
Metadata
- Authors
- Amestoy, P. R., Davis, T. A., & Duff, I. S.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2004-09
- Volume
- 30
- Issue
- 3
- Pages
- 381-388
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2074093855
- Cited by
- 311
- References
- 0
- FWCI
- 6.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. https://app.cochat.ai/papers/10.1145/1024074.1024081
- The paper
- Amestoy, P. R., Davis, T. A., & Duff, I. S. (2004). Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Transactions on Mathematical Software. https://doi.org/10.1145/1024074.1024081
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
