The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Abstract
SuiteSparseQR is a sparse QR factorization package based on the multifrontal method. Within each frontal matrix, LAPACK and the multithreaded BLAS enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel's Threading Building Blocks library. The symbolic analysis and ordering phase pre-eliminates singletons by permuting the input matrix A into the form [ R 11 R 12 ; 0 A 22 ] where R 11 is upper triangular with diagonal entries above a given tolerance. Next, the fill-reducing ordering, column elimination tree, and frontal matrix structures are found without requiring the formation of the pattern of A TA . Approximate rank-detection is performed within each frontal matrix using Heath's method. While Heath's method is not always exact, it has the advantage of not requiring column pivoting and thus does not interfere with the fill-reducing ordering. For sufficiently large problems, the resulting sparse QR factorization obtains a substantial fraction of the theoretical peak performance of a multicore computer.
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
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
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-citationNumerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
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 Linear Systems
Davis, T. A. (2006) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718881 · Cited by 1,443
Self-citationUsing OpenMP: portable shared memory parallel programming
(2008) · Choice Reviews Online · doi:10.5860/choice.46-0930 · Cited by 1,139
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Blackford, L. S., Choi, J., Cleary, A., D'Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., et al. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719642 · Cited by 1,030
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
Chapman, B., Jost, G., & van der Pas, R. (2007) · The MIT Press eBooks · Cited by 797
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-citationAn 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-citationIntel threading building blocks : outfitting C++ for multi-core processor parallelism
Reinders, J. R. (2007) · Cited by 708
Unitary Triangularization of a Nonsymmetric Matrix
Householder, A. S. (1958) · Journal of the ACM · doi:10.1145/320941.320947 · Cited by 629
Sparse 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
Lipton, R. J., Rose, D. J., & Tarjan, R. E. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716027 · Cited by 560
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-citationA 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-citationAnderson, E., Bai, Z., Bischof, C. H., et al. (1999) · Cited by 390
Computer Solution of Large Sparse Positive Definite
George, A. D., & Liu, J. W. (1981) · Cited by 348
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
Schreiber, R., & Van Loan, C. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910005 · Cited by 313
High-performance implementation of the level-3 BLAS
Goto, K., & Van De Geijn, R. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1377603.1377607 · Cited by 312
Algorithm 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-citationThe WY representation for products of householder matrices
Bischof, C., & Van Loan, C. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908009 · Cited by 295
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-citationOn Algorithms for Obtaining a Maximum Transversal
Duff, I. S. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355963 · Cited by 203
Solution of sparse linear least squares problems using givens rotations
George, A. D., & Heath, M. T. (1980) · Linear Algebra and its Applications · doi:10.1016/0024-3795(80)90159-7 · Cited by 199
Modifying a Sparse Cholesky Factorization
Davis, T. A., & Hager, W. W. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897321076 · Cited by 146
Self-citationThe 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
Sparse QR factorization in MATLAB
Matstoms, P. (1994) · ACM Transactions on Mathematical Software · doi:10.1145/174603.174408 · Cited by 68
A Data Structure for Sparse $QR$ and $LU$ Factorizations
George, A. D., Liu, J. K., & Ng, E. (1988) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0909008 · Cited by 46
Sparse Multifrontal Rank Revealing QR Factorization
Pierce, D. J., & Lewis, J. G. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479893244353 · Cited by 20
Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
Lu, S.-M., & Barlow, J. L. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479893259509 · Cited by 18
Metadata
- Authors
- Davis, T. A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2011-11
- Volume
- 38
- Issue
- 1
- Pages
- 1-22
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2053999255
- Cited by
- 271
- References
- 37
- FWCI
- 15.25
- 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.