The DOI matches its Crossref record.
A New Implementation of Sparse Gaussian Elimination
Open accessAbstract
An lmplementat]on of sparse LDL T and LU factorlzatlon and back substitution, based on a new scheme for storing sparse matrmes, is presented.The new method appears to be as efficmnt m terms of work and storage as existing schemes It is more amenable to efficmnt implementation on fast plpehned scmntlfic computers Categories and Subject Descriptors: G.
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
Cited by
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
Self-citationRoute Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
An Introduction to Chordal Graphs and Clique Trees
Blair, J. R. S., & Peyton, B. (1993) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-1-4613-8369-7_1 · Cited by 377
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Amestoy, P. R., Buttari, A., L'Excellent, J.-Y., & Mary, T. (2019) · ACM Transactions on Mathematical Software · doi:10.1145/3242094 · Cited by 305
Metadata
- Authors
- Schreiber, R.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1982-09
- Volume
- 8
- Issue
- 3
- Pages
- 256-276
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2089898547
- Cited by
- 199
- References
- 0
- FWCI
- 1.20
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A New Implementation of Sparse Gaussian Elimination. https://app.cochat.ai/papers/10.1145/356004.356006
- The paper
- Schreiber, R. (1982). A New Implementation of Sparse Gaussian Elimination. ACM Transactions on Mathematical Software. https://doi.org/10.1145/356004.356006
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.