The DOI matches its Crossref record; 104 of the 104 references it cites were found in a registry or an index.
A survey of sparse matrix research
Abstract
This paper surveys the state of the art in sparse matrix research in January 1976. Much of the survey deals with the solution of sparse simultaneous linear equations, including the storage of such matrices and the effect of paging on sparse matrix algorithms. In the symmetric case, relevant terms from graph theory are defined. Band systems and matrices arising from the discretization of partial differential equations are treated as separate cases. Preordering techniques are surveyed with particular emphasis on partitioning (to block triangular form) and tearing (to bordered block triangular form). Methods for solving the least squares problem and for sparse linear programming are also reviewed. The sparse eigenproblem is discussed with particular reference to some fairly recent iterative methods. There is a short discussion of general iterative techniques, and reference is made to good standard texts in this field. Design considerations when implementing sparse matrix algorithms are examined and finally comments are made concerning the availability of codes in this area.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Harary, F. (1969) · Cited by 10,739
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
Cited by
Updating the Inverse of a Matrix
Hager, W. W. (1989) · SIAM Review · doi:10.1137/1031049 · Cited by 1,103
An iterative pruning algorithm for feedforward neural networks
Castellano, G., Fanelli, A. M., & Pelillo, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572092 · Cited by 295
DeepCABAC: A Universal Compression Algorithm for Deep Neural Networks
Wiedemann, S., Kirchhoffer, H., Matlage, S., Haase, P., Marban, A., Marinc, T., Neumann, D., Nguyen, T., Schwarz, H., Wiegand, T., et al. (2020) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2020.2969554 · Cited by 113
Metadata
- Authors
- Duff, I. S.
- Venue
- Proceedings of the IEEE
- Published
- 1977
- Volume
- 65
- Issue
- 4
- Pages
- 500-535
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2128676746
- Cited by
- 262
- References
- 104
- FWCI
- 21.78
- 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
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 survey of sparse matrix research. https://app.cochat.ai/papers/10.1109/proc.1977.10514
- The paper
- Duff, I. S. (1977). A survey of sparse matrix research. Proceedings of the IEEE. https://doi.org/10.1109/proc.1977.10514
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.