The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
The university of Florida sparse matrix collection
Abstract
We describe the University of Florida Sparse Matrix Collection, a large and actively growing set of sparse matrices that arise in real applications. The Collection is widely used by the numerical linear algebra community for the development and performance evaluation of sparse matrix algorithms. It allows for robust and repeatable experiments: robust because performance results with artificially generated matrices can be misleading, and repeatable because matrices are curated and made publicly available in many formats. Its matrices cover a wide spectrum of domains, include those arising from problems with underlying 2D or 3D geometry (as structural engineering, computational fluid dynamics, model reduction, electromagnetics, semiconductor devices, thermodynamics, materials, acoustics, computer graphics/vision, robotics/kinematics, and other discretizations) and those that typically do not have such geometry (optimization, circuit simulation, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, power networks, and other networks and graphs). We provide software for accessing and managing the Collection, from MATLAB™, Mathematica™, Fortran, and C, as well as an online search capability. Graph visualization of the matrices is provided, and a new multilevel coarsening scheme is proposed to facilitate this task.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
(1999) · Cited by 12,854
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Bollobás, B. (1985) · Cited by 6,196
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
Amestoy, P. R., Duff, I. S., L'Excellent, J.-Y., & Koster, J. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899358194 · Cited by 2,287
Accuracy and stability of numerical algorithms
(1996) · Choice Reviews Online · doi:10.5860/choice.34-0981 · Cited by 2,072
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
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
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
Algorithm 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
Self-citationAn 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
Self-citationDuff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
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
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
Self-citationModular decomposition and transitive orientation
McConnell, R. M., & Spinrad, J. (1999) · Discrete Mathematics · doi:10.1016/s0012-365x(98)00319-7 · Cited by 436
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
Self-citationRealistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
Leskovec, J., Chakrabarti, D., Kleinberg, J., & Faloutsos, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564126_17 · Cited by 356
Computer Solution of Large Sparse Positive Definite
George, A. D., & Liu, J. W. (1981) · Cited by 348
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
Davis, T. A., & Duff, I. (1999) · ACM Transactions on Mathematical Software · doi:10.1145/305658.287640 · Cited by 318
Self-citationAlgorithm 837: AMD, an approximate minimum degree ordering algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024081 · Cited by 311
Self-citationAdaptive methods for the computation of PageRank
Kamvar, S., Haveliwala, T., & Golub, G. (2004) · Linear Algebra and its Applications · doi:10.1016/j.laa.2003.12.008 · Cited by 271
Matrix Market: a web resource for test matrix collections
Boisvert, R. F., Pozo, R., Remington, K., Barrett, R. F., & Dongarra, J. J. (1997) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-1-5041-2940-4_9 · Cited by 268
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
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
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
Duff, I. S., & Koster, J. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897317661 · Cited by 254
A column approximate minimum degree ordering algorithm
Davis, T. A., Gilbert, J. R., Larimore, S. I., & Ng, E. G. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024079 · Cited by 237
Self-citationSparse 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
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
Ng, E., & Peyton, B. W. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914063 · Cited by 206
On Algorithms for Obtaining a Maximum Transversal
Duff, I. S. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355963 · Cited by 203
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
Gupta, A. (1997) · IBM Journal of Research and Development · doi:10.1147/rd.411.0171 · Cited by 109
Davis, T. A. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1114268.1114277 · Cited by 109
Self-citationStrategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
Duff, I., & Pralet, S. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/04061043x · Cited by 99
On the optimality of the gridding reconstruction algorithm
Sedarat, H., & Nishimura, D. G. (2000) · IEEE Transactions on Medical Imaging · doi:10.1109/42.848182 · Cited by 99
CONTEST: A Controllable Test Matrix Toolbox for MATLAB
Taylor, A., & Higham, D. J. (2009) · ACM Transactions on Mathematical Software · doi:10.1145/1462173.1462175 · Cited by 94
Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
Gupta, A. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s089547980139604x · Cited by 70
A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
George, A. D., Heath, M. T., & Ng, E. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904013 · Cited by 35
Approximation of the Determinant of Large Sparse Symmetric Positive Definite Matrices
Reusken, A. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s089547980036869x · Cited by 26
Diagonal Markowitz Scheme with Local Symmetrization
Amestoy, P., Li, X. S., & Ng, E. (2007) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050637315 · Cited by 17
Model Reduction for High Dimensional Micro-FE Models
Rudnyi, E. B., & Korvink (2006) · Cited by 4
Cited by
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
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
A feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
Metadata
- Authors
- Davis, T. A., & Hu, Y.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2011-11
- Volume
- 38
- Issue
- 1
- Pages
- 1-25
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2035080386
- Cited by
- 3,630
- References
- 45
- FWCI
- 173.72
- 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.