MatrixMarket

The Matrix Market provides convenient access to a repository of test data for use in comparative studies of algorithms for numerical linear algebra. Matrices as well as matrix generation software and services, from linear systems, least squares, and eigenvalue computations in a wide variety of scientific and engineering disciplines are provided. Tools for browsing through the collection or for searching for matrices with special properties are included. Each matrix (and matrix set) has its own ”home page” which provides details of matrix properties, visualization of matrix structure, and permits downloading of the matrix in one of several text file formats. Similarly, each matrix generator has a home page describing its properties. Generators are either static software which you can download and include in your applications, Java applets which will generate matrices in your Web browser, or form-based requests to generate matrices at the Matrix Market and return them to your browser. Currently, 482 individual matrices and 25 matrix generators are available. Our database now includes the entire Harwell-Boeing Sparse Matrix Collection (Release I), Yousef Saad’s SPARSKIT collection, and the Nonsymmetric Eigenvalue Problem (NEP) collection of Bai, Day, Demmel and Dongarra. The Matrix Market is a component of the NIST project on Tools for Evaluation of Mathematical and Statistical Software which has focus areas in linear algebra, special functions and statistics.


References in zbMATH (referenced in 102 articles )

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

1 2 3 4 5 6 next

  1. Guglielmi, Nicola: On the method by Rostami for computing the real stability radius of large and sparse matrices (2016)
  2. Jessup, Elizabeth; Motter, Pate; Norris, Boyana; Sood, Kanika: Performance-based numerical solver selection in the Lighthouse framework (2016)
  3. Kestyn, James; Polizzi, Eric; Tang, Ping Tak Peter: Feast eigensolver for non-Hermitian problems (2016)
  4. Kostić, Vladimir R.; Międlar, Agnieszka; Cvetković, Ljiljana: An algorithm for computing minimal Ger\vsgorinsets. (2016)
  5. Michailidis, Panagiotis D.; Margaritis, Konstantinos G.: Scientific computations on multi-core systems using different programming frameworks (2016)
  6. Wellin, Paul: Essentials of programming in Mathematica (2016)
  7. Bebiano, N.; da Provid^encia, J.; Nata, A.; da Provid^encia, J.P.: An inverse indefinite numerical range problem (2015)
  8. Beik, Fatemeh Panjeh Ali; Salkuyeh, Davod Khojasteh: Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations (2015)
  9. Bujanović, Zvonimir; Drmač, Zlatko: A new framework for implicit restarting of the Krylov-Schur algorithm. (2015)
  10. Buttà, P.; Guglielmi, N.; Manetta, M.; Noschese, S.: Differential equations for real-structured defectivity measures (2015)
  11. Gaaf, Sarah W.; Hochstenbach, Michiel E.: Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization (2015)
  12. Gower, Robert M.; Richtárik, Peter: Randomized iterative methods for linear systems (2015)
  13. Kostić, Vladimir R.; Miȩdlar, Agnieszka; Stolwijk, Jeroen J.: On matrix nearness problems: distance to delocalization (2015)
  14. Lecomte, Christophe: TRAX: an approach for the time rational analysis of complex dynamic systems (2015)
  15. Lei, Yuan: The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense (2015)
  16. Li, Liang; Huang, Ting-Zhu; Jing, Yan-Fei; Ren, Zhi-Gang: Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (2015)
  17. Röhrig-Zöllner, Melven; Thies, Jonas; Kreutzer, Moritz; Alvermann, Andreas; Pieper, Andreas; Basermann, Achim; Hager, Georg; Wellein, Gerhard; Fehske, Holger: Increasing the performance of the Jacobi-Davidson method by blocking (2015)
  18. Shahzadeh Fazeli, S.A.; Emad, Nahid; Liu, Zifan: A key to choose subspace size in implicitly restarted Arnoldi method (2015)
  19. van Gijzen, Martin B.; Sleijpen, Gerard L.G.; Zemke, Jens-Peter M.: Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems. (2015)
  20. 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)

1 2 3 4 5 6 next


Further publications can be found at: http://math.nist.gov/MatrixMarket/bib.html