The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
Abstract
A new method for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The column ordering is selected to give a good a priori upper bound on fill-in and then refined during numerical factorization (while preserving the bound). Pivot rows are selected to maintain numerical stability and to preserve sparsity. The method analyzes the matrix and automatically selects one of three pre-ordering and pivoting strategies. The number of nonzeros in the LU factors computed by the method is typically less than or equal to those found by a wide range of unsymmetric sparse LU factorization methods, including left-looking methods and prior multifrontal methods.
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
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
Amestoy, P. R., Duff, I. S., L'Excellent, J.-Y., & Koster, J. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899358194 · Cited by 2,287
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
A set of level 3 basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Duff, I. S. (1990) · ACM Transactions on Mathematical Software · doi:10.1145/77626.79170 · Cited by 1,821
Direct 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
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method
Davis, T. A. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/992200.992206 · Cited by 1,422
Self-citationA Supernodal Approach to Sparse Partial Pivoting
Demmel, J. W., Eisenstat, S. C., Gilbert, J. R., Li, X. S., & Liu, J. W. H. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895291765 · Cited by 840
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-citationSparse Matrices in MATLAB: Design and Implementation
Gilbert, J. R., Moler, C., & Schreiber, R. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613024 · Cited by 591
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
Davis, T. A., & Duff, I. S. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894246905 · Cited by 520
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
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
Duff, I. S., & Koster, J. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899358443 · Cited by 358
Computer Solution of Large Sparse Positive Definite
George, A. D., & Liu, J. W. (1981) · Cited by 348
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
Davis, T. A., & Duff, I. (1999) · ACM Transactions on Mathematical Software · doi:10.1145/305658.287640 · Cited by 318
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-citationA 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-citationSparse Partial Pivoting in Time Proportional to Arithmetic Operations
Gilbert, J. R., & Peierls, T. (1988) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0909058 · Cited by 227
On Algorithms for Obtaining a Maximum Transversal
Duff, I. S. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355963 · Cited by 203
Solving Sparse Linear Systems with Sparse Backward Error
Arioli, M., Demmel, J. W., & Duff, I. S. (1989) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0610013 · Cited by 184
Improving 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
The influence of relaxed supernode partitions on the multifrontal method
Ashcraft, C., & Grimes, R. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/76909.76910 · Cited by 115
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
George, A. D., & Ng, E. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908072 · Cited by 98
Robust Ordering of Sparse Matrices using Multisection
Ashcraft, C., & Liu, J. W. H. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896299081 · Cited by 90
Analysis and comparison of two general sparse solvers for distributed memory computers
Amestoy, P., Duff, I., L’Excellent, J.-Y., & Li, X. S. (2001) · ACM Transactions on Mathematical Software · doi:10.1145/504210.504212 · Cited by 76
Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
Gupta, A. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s089547980139604x · Cited by 70
Sparse QR factorization in MATLAB
Matstoms, P. (1994) · ACM Transactions on Mathematical Software · doi:10.1145/174603.174408 · Cited by 68
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
Eisenstat, S. C., & Liu, J. W. H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613017 · Cited by 42
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
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method
Davis, T. A. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/992200.992206 · Cited by 1,422
Self-citationAlgorithm 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-citationOn the spatial statistics of optical flow
Roth, S., & Black, M. J. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.180 · Cited by 95
Metadata
- Authors
- Davis, T. A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2004-06
- Volume
- 30
- Issue
- 2
- Pages
- 165-195
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W1987902628
- Cited by
- 419
- References
- 27
- FWCI
- 19.05
- 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.