Harwell-Boeing sparse matrix collection

Sparse matrix test problems. 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.


References in zbMATH (referenced in 216 articles )

Showing results 1 to 20 of 216.
Sorted by year (citations)

1 2 3 ... 9 10 11 next

  1. Cavero, Sergio; Pardo, Eduardo G.; Laguna, Manuel; Duarte, Abraham: Multistart search for the cyclic cutwidth minimization problem (2021)
  2. Cipolla, Stefano; Durastante, Fabio; Tudisco, Francesco: Nonlocal pagerank (2021)
  3. Fasi, Massimiliano; Higham, Nicholas J.: Matrices with tunable infinity-norm condition number and no need for pivoting in LU factorization (2021)
  4. Gower, Robert M.; Molitor, Denali; Moorman, Jacob; Needell, Deanna: On adaptive sketch-and-project for solving linear systems (2021)
  5. Greenbaum, Anne; Liu, Hexuan; Chen, Tyler: On the convergence rate of variants of the conjugate gradient algorithm in finite precision arithmetic (2021)
  6. Al-Baali, Mehiddin; Caliciotti, Andrea; Fasano, Giovanni; Roma, Massimo: A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization (2020)
  7. Pandur, Marija Miloloža: Preconditioned gradient iterations for the eigenproblem of definite matrix pairs (2019)
  8. Wang, Rui-Rui; Niu, Qiang; Tang, Xiao-Bin; Wang, Xiang: Solving shifted linear systems with restarted GMRES augmented with error approximations (2019)
  9. Wu, Tao; Gleich, David F.: Multiway Monte Carlo method for linear systems (2019)
  10. Arzani, F.; Peyghami, M. Reza: An approach based on dwindling filter method for positive definite generalized eigenvalue problem (2018)
  11. Gonzaga de Oliveira, Sanderson L.; Bernardes, Júnior A. B.; Chagas, Guilherme O.: An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (2018)
  12. Mallach, Sven: Linear ordering based MIP formulations for the vertex separation or pathwidth problem (2018)
  13. Schlüter, Federico; Strappa, Yanela; Milone, Diego H.; Bromberg, Facundo: Blankets joint posterior score for learning Markov network structures (2018)
  14. Wei, Wei; Dai, Hua: Implicitly restarted refined generalised Arnoldi method with deflation for the polynomial eigenvalue problem (2018)
  15. Jacquelin, Mathias; Lin, Lin; Yang, Chao: \textttPselinv-- a distributed memory parallel algorithm for selected inversion, the symmetric case (2017)
  16. Ji, Hao; Li, Yaohang: A breakdown-free block conjugate gradient method (2017)
  17. Stachurski, Andrzej: On a conjugate directions method for solving strictly convex QP problem (2017)
  18. Wei, Wei; Dai, Hua: Implicitly restarted refined partially orthogonal projection method with deflation (2017)
  19. Zhu, Yao; Gleich, David F.; Grama, Ananth: Erasure coding for fault-oblivious linear system solvers (2017)
  20. Gu, Xian-Ming; Huang, Ting-Zhu; Carpentieri, Bruno: BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems (2016)

1 2 3 ... 9 10 11 next