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
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
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
Parallel Programmability and the Chapel Language
Chamberlain, B. L., Callahan, D., & Zima, H. P. (2007) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342007078442 · Cited by 879
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-citationAlgorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Covariance Tapering for Interpolation of Large Spatial Datasets
Furrer, R., Genton, M. G., & Nychka, D. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x132178 · Cited by 738
An Approximate Minimum Degree Ordering Algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894278952 · Cited by 731
Classes of kernels for machine learning: a statistics perspective
Genton, M. G. (2002) · doi:10.5555/944790.944815 · Cited by 607
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/s1052623494240456 · Cited by 604
An 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
OSKI: A library of automatically tuned sparse matrix kernels
Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/16/1/071 · Cited by 490
EIT reconstruction algorithms: pitfalls, challenges and recent developments
Lionheart, W. R. B. (2004) · Physiological Measurement · doi:10.1088/0967-3334/25/1/021 · Cited by 447
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
So you think you can DAS? A viewpoint on delay-and-sum beamforming
Perrot, V., Polichetti, M., Varray, F., & Garcia, D. (2021) · Ultrasonics · doi:10.1016/j.ultras.2020.106309 · Cited by 377
Oostenveld, R., & Oostendorp, T. F. (2002) · Human Brain Mapping · doi:10.1002/hbm.10061 · Cited by 368
Zhang, W., Zheng, S., Hui, X., Dong, R., Jin, X., Chi, H., & Zhang, X. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2645199 · Cited by 300
Isoperimetric graph partitioning for image segmentation
Grady, L., & Schwartz, E. L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.57 · Cited by 272
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Davis, T. A. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049670 · Cited by 271
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
Demmel, J. W., Gilbert, J. R., & Li, X. S. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897317685 · Cited by 255
Self-citationSelf-Adapting Linear Algebra Algorithms and Software
Demmel, J., Dongarra, J., Eijkhout, V., Fuentes, E., Petitet, A., Vuduc, R., Whaley, R. C., & Yelick, K. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840848 · Cited by 204
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
Buluc, A., & Gilbert, J. R. (2008) · 2008 37th International Conference on Parallel Processing · doi:10.1109/icpp.2008.45 · Cited by 112
Self-citation
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.