The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Sparse Matrices in MATLAB: Design and Implementation
Abstract
The matrix computation language and environment MATLAB is extended to include sparse matrix storage and operations. The only change to the outward appearance of the MATLAB language is a pair of commands to create full or sparse matrices. Nearly all the operations of MATLAB now apply equally to full or sparse matrices, without any explicit action by the user. The sparse data structure represents a matrix in space proportional to the number of nonzero entries, and most of the operations compute sparse results in time proportional to the number of arithmetic operations on nonzeros.
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
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
Matrix Eigensystem Routines — EISPACK Guide
Smith, B. T., Boyle, J. M., Dongarra, J. J., Garbow, B. S., Ikebe, Y., Klema, V. C., & Moler, C. (1976) · Lecture notes in computer science · doi:10.1007/3-540-07546-1 · Cited by 830
Self-citationDuff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
Handbook for Automatic Computation
Wilkinson, J. H., & Reinsch, C. (1971) · Springer eBooks · doi:10.1007/978-3-642-86940-2 · Cited by 545
The Evolution of the Minimum Degree Ordering Algorithm
George, A. D., & Liu, J. W. H. (1989) · SIAM Review · doi:10.1137/1031001 · Cited by 395
Handbook for Automatic Computation
Rutishauser, H. (1967) · Springer eBooks · doi:10.1007/978-3-642-86934-1 · Cited by 383
A comparison of sorting algorithms for the connection machine CM-2
Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., & Zagha, M. (1991) · Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91 · doi:10.1145/113379.113380 · Cited by 335
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
Gilbert, J. R., & Peierls, T. (1988) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0909058 · Cited by 227
Self-citationA New Implementation of Sparse Gaussian Elimination
Schreiber, R. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/356004.356006 · Cited by 199
Self-citationProgress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
Ashcraft, C., Grimes, R. G., Lewis, J. G., Peyton, B. W., Simon, H. D., & Bjørstad, P. E. (1987) · The International Journal of High Performance Computing Applications · doi:10.1177/109434208700100403 · Cited by 149
Tridiagonalization of a symetric band matrix
Schwarz, H. R. (1968) · Numerische Mathematik · doi:10.1007/bf02162505 · Cited by 99
Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
Eisenstat, S. C., Schultz, M. H., & Sherman, A. H. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902019 · Cited by 84
Cited by
A fast diffeomorphic image registration algorithm
Ashburner, J. (2007) · NeuroImage · doi:10.1016/j.neuroimage.2007.07.007 · Cited by 8,122
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
Shampine, L. F., & Reichelt, M. W. (1997) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594276424 · Cited by 3,599
From Frequency to Meaning: Vector Space Models of Semantics
Turney, P. D., & Pantel, P. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2934 · Cited by 2,866
Nonlinear Model Reduction via Discrete Empirical Interpolation
Chaturantabut, S., & Sorensen, D. C. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090766498 · Cited by 1,925
Metadata
- Authors
- Gilbert, J. R., Moler, C., & Schreiber, R.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1992-01
- Volume
- 13
- Issue
- 1
- Pages
- 333-356
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2007259720
- Cited by
- 591
- References
- 12
- FWCI
- 6.05
- 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.