SparseMatrix

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 395 articles , 1 standard article )

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

1 2 3 ... 18 19 20 next

  1. Ahmadi-Asl, Salman; Beik, Fatemeh Panjeh Ali: Iterative algorithms for least-squares solutions of a quaternion matrix equation (2017)
  2. Aihara, Kensuke: Variants of the groupwise update strategy for short-recurrence Krylov subspace methods (2017)
  3. Bentbib, Abdeslem Hafid; Jbilou, Khalide; Sadek, El Mostafa: On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations (2017)
  4. Benzi, Michele; Uçar, Bora: Preconditioning techniques based on the Birkhoff-von Neumann decomposition (2017)
  5. Boutsidis, Christos; Drineas, Petros; Kambadur, Prabhanjan; Kontopoulou, Eugenia-Maria; Zouzias, Anastasios: A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix (2017)
  6. Cerdán, J.; Marín, J.; Mas, J.: Low-rank updates of balanced incomplete factorization preconditioners (2017)
  7. Fika, Paraskevi; Mitrouli, Marilena: Aitken’s method for estimating bilinear forms arising in applications (2017)
  8. Fischer, Thomas M.: On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation (2017)
  9. Gambhir, Arjun Singh; Stathopoulos, Andreas; Orginos, Kostas: Deflation as a method of variance reduction for estimating the trace of a matrix inverse (2017)
  10. Gatto, P.; Hesthaven, Jan S.: Efficient preconditioning of $hp$-FEM matrices by hierarchical low-rank approximations (2017)
  11. Gupta, Anshul: Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition (2017)
  12. Han, Insu; Malioutov, Dmitry; Avron, Haim; Shin, Jinwoo: Approximating spectral sums of large-scale matrices using stochastic Chebyshev approximations (2017)
  13. Higham, Nicholas J.; Kandolf, Peter: Computing the action of trigonometric and hyperbolic matrix functions (2017)
  14. Imakura, Akira; Sakurai, Tetsuya: Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems (2017)
  15. Ji, Hao; Li, Yaohang: Block conjugate gradient algorithms for least squares problems (2017)
  16. Ji, Hao; Li, Yaohang: A breakdown-free block conjugate gradient method (2017)
  17. Jing, Yan-Fei; Yuan, Pei; Huang, Ting-Zhu: A simpler GMRES and its adaptive variant for shifted linear systems. (2017)
  18. Kandolf, Peter; Relton, Samuel D.: A block Krylov method to compute the action of the Fréchet derivative of a matrix function on a vector with applications to condition number estimation (2017)
  19. Kressner, Daniel; Šušnjara, Ana: Fast computation of spectral projectors of banded matrices (2017)
  20. Lamm, Sebastian; Sanders, Peter; Schulz, Christian; Strash, Darren; Werneck, Renato F.: Finding near-optimal independent sets at scale (2017)

1 2 3 ... 18 19 20 next