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 185 articles )

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

1 2 3 ... 8 9 10 next

  1. Zhu, Yao; Gleich, David F.; Grama, Ananth: Erasure coding for fault-oblivious linear system solvers (2017)
  2. Gu, Xian-Ming; Huang, Ting-Zhu; Carpentieri, Bruno: BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems (2016)
  3. Lubin, Miles; Dunning, Iain: Computing in operations research using Julia (2015)
  4. Zhong, Hong-xiu; Wu, Gang; Chen, Guo-liang: A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides (2015)
  5. Agullo, E.; Giraud, L.; Jing, Y.-F.: Block GMRES method with inexact breakdowns and deflated restarting (2014)
  6. Baglama, James; Richmond, Daniel J.: Implicitly restarting the LSQR algorithm (2014)
  7. Reinelt, Gerhard; Seitz, Hanna: On a binary distance model for the minimum linear arrangement problem (2014)
  8. Wu, Gang; Zhang, Lu: On expansion of search subspaces for large non-Hermitian eigenproblems (2014)
  9. Zak, Mohammad Khorsand; Toutounian, Faezeh: Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning (2014)
  10. Astudillo, R.; Castillo, Z.: Computing pseudospectra using block implicitly restarted Arnoldi iteration (2013)
  11. Baglama, James; Reichel, Lothar: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (2013)
  12. Betcke, Timo; Higham, Nicholas J.; Mehrmann, Volker; Schröder, Christian; Tisseur, Françoise: NLEVP, a collection of nonlinear eigenvalue problems (2013)
  13. Gebremedhin, Assefaw H.; Nguyen, Duc; Patwary, Md.Mostofa Ali; Pothen, Alex: ColPack, software for graph coloring and related problems in scientific computing (2013)
  14. Hungerländer, P.; Rendl, F.: Semidefinite relaxations of ordering problems (2013)
  15. Jia, ZhongXiao: On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems (2013)
  16. Niu, Qiang; Lu, Lin-Zhang; Liu, Gang: Accelerated GCRO-DR method for solving sequences of systems of linear equations (2013)
  17. Wang, Xiang; Niu, Qiang; Lu, Lin-Zhang: A refined Arnoldi type method for large scale eigenvalue problems (2013)
  18. Lin, Yiqin; Bao, Liang; Wu, Qinghua: Simpler GMRES with deflated restarting (2012)
  19. Lin, Yiqin; Li, Wenbo; Bao, Liang; Wu, Qinghua: On the block GMRES method with deflated restarting (2011)
  20. Rump, Siegfried M.: Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse (2011)

1 2 3 ... 8 9 10 next