The DOI matches its Crossref record.
A column approximate minimum degree ordering algorithm
Abstract
Sparse Gaussian elimination with partial pivoting computes the factorization PAQ = LU of a sparse matrix A , where the row ordering P is selected during factorization using standard partial pivoting with row interchanges. The goal is to select a column preordering, Q , based solely on the nonzero pattern of A , that limits the worst-case number of nonzeros in the factorization. The fill-in also depends on P , but Q is selected to reduce an upper bound on the fill-in for any subsequent choice of P . The choice of Q can have a dramatic impact on the number of nonzeros in L and U . One scheme for determining a good column ordering for A is to compute a symmetric ordering that reduces fill-in in the Cholesky factorization of A T A . A conventional minimum degree ordering algorithm would require the sparsity structure of A T A to be computed, which can be expensive both in terms of space and time since A T A may be much denser than A . An alternative is to compute Q directly from the sparsity structure of A ; this strategy is used by MATLAB's COLMMD preordering algorithm. A new ordering algorithm, COLAMD, is presented. It is based on the same strategy but uses a better ordering heuristic. COLAMD is faster and computes better orderings, with fewer nonzeros in the factors of the matrix.
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
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-citationDirect Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
iSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076
Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Self-citationSuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Li, X. S., & Demmel, J. W. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779361 · Cited by 628
An overview of SuperLU: Algorithms, implementation, and user interface
Li, X. S. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089017 · Cited by 467
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-citationAlgorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems
Davis, T. A., & Palamadai Natarajan, E. (2010) · ACM Transactions on Mathematical Software · doi:10.1145/1824801.1824814 · Cited by 337
Self-citationAlgorithm 837: AMD, an approximate minimum degree ordering algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024081 · Cited by 311
Self-citationInformation fusion in navigation systems via factor graph based incremental smoothing
Indelman, V., Williams, S., Kaess, M., & Dellaert, F. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.05.001 · Cited by 271
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Davis, T. A. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049670 · Cited by 271
Self-citationKaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J., & Dellaert, F. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979641 · Cited by 267
Williams, S., Indelman, V., Kaess, M., Roberts, R., Leonard, J. J., & Dellaert, F. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914531056 · Cited by 2
Metadata
- Authors
- Davis, T. A., Gilbert, J. R., Larimore, S. I., & Ng, E. G.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2004-09
- Volume
- 30
- Issue
- 3
- Pages
- 353-376
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2167797964
- Cited by
- 237
- References
- 0
- FWCI
- 9.86
- 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.