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
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.