The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Abstract
We present the main algorithmic features in the software package SuperLU_DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with a focus on scalability issues, and demonstrate the software's parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication patterns, which lets us exploit techniques used in parallel sparse Cholesky algorithms to better parallelize both LU decomposition and triangular solution on large-scale distributed machines.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
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
Applied Numerical Linear Algebra
Demmel, J. W. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971446 · Cited by 2,299
Self-citationA 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
Applied numerical linear algebra
(1998) · Choice Reviews Online · doi:10.5860/choice.35-3919 · Cited by 2,170
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
Introduction to parallel computing
(2004) · Choice Reviews Online · doi:10.5860/choice.42-0990 · Cited by 1,843
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
Karypis, G., & Kumar, V. (1997) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 1,215
Introduction to parallel computing: design and analysis of algorithms
Kumar, V., Grama, A. Y., Gupta, A., & Karypis, G. (1994) · Benjamin-Cummings Publishing Co., Inc. eBooks · Cited by 1,210
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
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
Self-citationSPARSKIT: A basic tool kit for sparse matrix computations
Saad, Y. (1990) · NASA Technical Reports Server (NASA) · Cited by 734
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
The Chaco user`s guide. Version 1.0
Hendrickson, B., & Leland, R. (1993) · doi:10.2172/10106339 · Cited by 655
The Elimination form of the Inverse and its Application to Linear Programming
Markowitz, H. M. (1957) · Management Science · doi:10.1287/mnsc.3.3.255 · Cited by 512
Collisional Breakup in a Quantum System of Three Charged Particles
Rescigno, T. N., Baertschy, M., Isaacs, W. A., & McCurdy, C. W. (1999) · Science · doi:10.1126/science.286.5449.2474 · Cited by 465
Modification of the minimum-degree algorithm by multiple elimination
Liu, J. W. H. (1985) · ACM Transactions on Mathematical Software · doi:10.1145/214392.214398 · Cited by 361
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
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
Demmel, J. W., Gilbert, J. R., & Li, X. S. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897317685 · Cited by 255
Self-citationThe Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
Duff, I. S., & Koster, J. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897317661 · Cited by 254
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
Highly scalable parallel algorithms for sparse matrix factorization
Gupta, A., Karypis, G., & Kumar, V. (1997) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.598277 · Cited by 229
Design, implementation and testing of extended and mixed precision BLAS
Li, X. S., Demmel, J. W., Bailey, D. H., Henry, G., Hida, Y., Iskandar, J., Kahan, W., Kang, S. Y., Kapur, A., Martin, M. C., et al. (2002) · ACM Transactions on Mathematical Software · doi:10.1145/567806.567808 · Cited by 226
Self-citationSolving 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
Self-citationEfficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors
Schenk, O., Gärtner, K., & Fichtner, W. (2000) · BIT Numerical Mathematics · doi:10.1023/a:1022326604210 · Cited by 181
Users' guide for the Harwell-Boeing sparse matrix collection (Release 1)
Duff, I., Grimes, R., & Lewis, J. (1992) · Technical report. RAL - Council for the Central Laboratory of the Research Councils · Cited by 157
SPOOLES: An Object-Oriented Sparse Matrix Library.
Ashcraft, C., & Grimes, R. G. (1999) · PPSC · Cited by 147
A new pivoting strategy for Gaussian elimination
Olschowka, M., & Neumaier, A. (1996) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)00192-8 · Cited by 126
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
Making Sparse Gaussian Elimination Scalable by Static Pivoting
Li, X. S., & Demmel, J. W. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509092 · Cited by 77
Self-citationAnalysis 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
Self-citationImproved 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
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
Highly Parallel Sparse Triangular Solution
Alvarado, F., Pothen, A., & Schreiber, R. (1993) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4613-8369-7_7 · Cited by 34
Performance of a Fully Parallel Sparse Solver
Heath, M. T., & Raghavan, P. (1997) · The International Journal of Supercomputer Applications and High Performance Computing · doi:10.1177/109434209701100104 · Cited by 23
Diagonal Markowitz Scheme with Local Symmetrization
Amestoy, P., Li, X. S., & Ng, E. (2007) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050637315 · Cited by 17
Self-citationBaertschy, M. D., & Li, X. (2001) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1145/582034.582081 · Cited by 16
Self-citationDiagonal Markowitz scheme with local symmetrization
Amestoy, P., Li, X. S., & Eg, E. G. (2003) · Cited by 4
Self-citation
Cited by
Auto-tuning a high-level language targeted to GPU codes
Grauer-Gray, S., Xu, L., Searles, R., Ayalasomayajula, S., & Cavazos, J. (2012) · 2012 Innovative Parallel Computing (InPar) · doi:10.1109/inpar.2012.6339595 · Cited by 470
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
“We observed 20% to 40% uniprocessor performance improvement [Li and Demmel 2003].”
BackgroundMethodSelf-citationLuisier, M., Schenk, A., Fichtner, W., & Klimeck, G. (2006) · Physical Review B · doi:10.1103/physrevb.74.205323 · Cited by 411
Solvers for the cardiac bidomain equations
Vigmond, E. J., Weber dos Santos, R., Prassl, A. J., Deo, M., & Plank, G. (2008) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2007.07.012 · Cited by 344
Stable Generalized Finite Element Method (SGFEM)
Babuška, I., & Banerjee, U. (2012) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2011.09.012 · Cited by 323
Metadata
- Authors
- Li, X. S., & Demmel, J. W.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2003-06
- Volume
- 29
- Issue
- 2
- Pages
- 110-140
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2141331848
- Cited by
- 628
- References
- 44
- FWCI
- 21.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.