The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
An Approximate Minimum Degree Ordering Algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894278952 · Cited by 731
Self-citationThe Evolution of the Minimum Degree Ordering Algorithm
George, A. D., & Liu, J. W. H. (1989) · SIAM Review · doi:10.1137/1031001 · Cited by 395
A column approximate minimum degree ordering algorithm
Davis, T. A., Gilbert, J. R., Larimore, S. I., & Ng, E. G. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024079 · Cited by 237
Self-citationImproving the Run Time and Quality of Nested Dissection Ordering
Hendrickson, B., & Rothberg, E. E. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596300656 · Cited by 140
Cited by
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Self-citationOSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
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
ECOS: An SOCP solver for embedded systems
Domahidi, A., Chu, E., & Boyd, S. (2013) · 2013 European Control Conference (ECC) · doi:10.23919/ecc.2013.6669541 · Cited by 727
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
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
- 5
- 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
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.