The University of Florida Sparse Matrix Collection. 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.

References in zbMATH (referenced in 616 articles , 1 standard article )

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

1 2 3 ... 29 30 31 next

  1. Zou, Qinmeng; Magoulès, Frédéric: Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (2021)
  2. Abdaoui, Ilias; Elbouyahyaoui, Lakhdar; Heyouni, Mohammed: The simpler block CMRH method for linear systems (2020)
  3. Azad, Ariful; Buluç, Aydin; Li, Xiaoye S.; Wang, Xinliang; Langguth, Johannes: A distributed-memory algorithm for computing a heavy-weight perfect matching on bipartite graphs (2020)
  4. Benner, Peter; Bujanović, Zvonimir; Kürschner, Patrick; Saak, Jens: A numerical comparison of different solvers for large-scale, continuous-time algebraic Riccati equations and LQR problems (2020)
  5. Cambier, Léopold; Chen, Chao; Boman, Erik G.; Rajamanickam, Sivasankaran; Tuminaro, Raymond S.; Darve, Eric: An algebraic sparsified nested dissection algorithm using low-rank approximations (2020)
  6. Carson, Erin Claire: An adaptive (s)-step conjugate gradient algorithm with dynamic basis updating. (2020)
  7. Cerdán, J.; Guerrero, D.; Marín, J.; Mas, J.: Preconditioners for rank deficient least squares problems (2020)
  8. Chao, Zhen; Xie, Dexuan; Sameh, Ahmed H.: Preconditioners for nonsymmetric indefinite linear systems (2020)
  9. Chen, Jia-Qi; Huang, Zheng-Da: On the error estimate of the randomized double block Kaczmarz method (2020)
  10. Çuğu, İlke; Manguoğlu, Murat: A parallel multithreaded sparse triangular linear system solver (2020)
  11. Davis, Timothy A.; Duff, Iain S.; Nakov, Stojce: Design and implementation of a parallel Markowitz threshold algorithm (2020)
  12. Davis, Timothy A.; Hager, William W.; Kolodziej, Scott P.; Yeralan, S. Nuri: Algorithm 1003: Mongoose, a graph coarsening and partitioning library (2020)
  13. Duff, Iain; Hogg, Jonathan; Lopez, Florent: A new sparse (LDL^T) solver using a posteriori threshold pivoting (2020)
  14. Frommer, Andreas; Lund, Kathryn; Szyld, Daniel B.: Block Krylov subspace methods for functions of matrices. II: Modified block FOM (2020)
  15. Fukaya, Takeshi; Kannan, Ramaseshan; Nakatsukasa, Yuji; Yamamoto, Yusaku; Yanagisawa, Yuka: Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices (2020)
  16. Gu, Xian-Ming; Huang, Ting-Zhu; Carpentieri, Bruno; Imakura, Akira; Zhang, Ke; Du, Lei: Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously (2020)
  17. Itoh, Shoji; Sugihara, Masaaki: Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method (2020)
  18. Kalantzis, Vassilis: A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems (2020)
  19. Kim, Jongeun; Veremyev, Alexander; Boginski, Vladimir; Prokopyev, Oleg A.: On the maximum small-world subgraph problem (2020)
  20. Li, Chengliang; Ma, Changfeng: The inexact Euler-extrapolated block preconditioners for a class of complex linear systems (2020)

1 2 3 ... 29 30 31 next