The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
Abstract
Existing sparse partial pivoting algorithms can spend asymptotically more time manipulating data structures than doing arithmetic, although they are tuned to be efficient on many large problems. We present an algorithm to factor sparse matrices by Gaussian elimination with partial pivoting in time proportional to the number of arithmetic operations. Implementing this algorithm requires only simple data structures and gives a code that in preliminary experiments is competitive with existing sparse codes. The key idea is a new triangular solver that uses depth-first search and topological ordering to take advantage of sparsity in the right-hand side.
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
Cites
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
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
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
A 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-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
Self-citationAn 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
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
Solving Real-World Linear Programs: A Decade and More of Progress
Bixby, R. E. (2002) · Operations Research · doi:10.1287/opre.50.1.3.17780 · Cited by 386
Algorithm 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
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
Metadata
- Authors
- Gilbert, J. R., & Peierls, T.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1988-09
- Volume
- 9
- Issue
- 5
- Pages
- 862-874
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2020561008
- Cited by
- 227
- References
- 1
- FWCI
- 3.45
- 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.