The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Sparse matrix test problems
Open accessAbstract
We describe the Harwell-Boeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. Our test set comprises problems in linear systems, least squares, and eigenvalue calculations from a wide variety of scientific and engineering disciplines. The problems range from small matrices, used as counter-examples to hypotheses in sparse matrix research, to large test cases arising in large-scale computation. We offer the collection to other researchers as a standard benchmark for comparative studies of algorithms. The procedures for obtaining and using the test collection are discussed. We also describe the guidelines for contributing further test problems to the collection.
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
Testing Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,527
Cited by
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
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
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
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
Self-citationSPLASH: Stanford parallel applications for shared-memory
Singh, J. P., Weber, W.-D., & Gupta, A. (1992) · ACM SIGARCH Computer Architecture News · doi:10.1145/130823.130824 · Cited by 925
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
Expokit: a software package for computing matrix exponentials
Sidje, R. B. (1998) · ACM Transactions on Mathematical Software · doi:10.1145/285861.285868 · Cited by 781
“6.2 A Nonsymmetric Example The matrix of this example is the unsymmetric matrix ORAN1678 of the Harwell-Boeing collection [Duff et al. 1989].”
MethodInfluentialAn 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-citationSparse 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
Large-Scale Sparse Singular Value Computations
Berry, M. W. (1992) · The International Journal of Supercomputing Applications · doi:10.1177/109434209200600103 · Cited by 402
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
Benzi, M., Meyer, C. D., & Tůma, M. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594271421 · Cited by 389
Exploiting HMM Sparsity to Perform Online Real-Time Nonintrusive Load Monitoring
Makonin, S., Popowich, F., Bajic, I. V., Gill, B., & Bartram, L. (2016) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2494592 · Cited by 378
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
Wu, K., & Simon, H. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898334605 · Cited by 306
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
Freund, R. W., Gutknecht, M. H., & Nachtigal, N. M. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914009 · Cited by 304
NLEVP: A Collection of Nonlinear Eigenvalue Problems
Betcke, T., Higham, N. J., Mehrmann, V., Schröder, C., & Tisseur, F. (2013) · ACM Transactions on Mathematical Software · doi:10.1145/2427023.2427024 · Cited by 303
GMRES with Deflated Restarting
Morgan, R. B. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599364659 · Cited by 289
3D-ICE: Fast compact transient thermal modeling for 3D ICs with inter-tier liquid cooling
Sridhar, A., Vincenzi, A., Ruggiero, M., Brunschwiler, T., & Atienza, D. (2010) · 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) · doi:10.1109/iccad.2010.5653749 · Cited by 284
Trust region Newton methods for large-scale logistic regression
Lin, C.-J., Weng, R. C., & Keerthi, S. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273567 · Cited by 284
A comparative study of sparse approximate inverse preconditioners
Benzi, M., & Tûma, M. (1999) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(98)00118-4 · Cited by 280
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
Algebraic Decision Diagrams and Their Applications
Bahar, R. I., Frohm, E. A., Gaona, C. M., Hachtel, G. D., Macii, E., Pardo, A., & Somenzi, F. (1997) · Formal Methods in System Design · doi:10.1023/a:1008699807402 · Cited by 267
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
Self-citation
Metadata
- Authors
- Duff, I. S., Grimes, R. G., & Lewis, J. G.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1989-03
- Volume
- 15
- Issue
- 1
- Pages
- 1-14
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2147542748
- Cited by
- 650
- References
- 1
- FWCI
- 28.32
- 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
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.