Sparse Matrix Collection
July 20, 2010
The images above of matrices in the UF Sparse Matrix Collection were created by Yifan Hu, AT&T. As of Oct 2009, it contains 2272 problems (some of which are sequences of dozens of matrices). The largest has a dimension of almost 29 million, with 760 million nonzero entries. The matrices are available in three formats: MATLAB mat-file, Rutherford-Boeing, and Matrix Market. Note that the MATLAB mat-files can only be read by MATLAB 7.0 or later.
From the abstract of the paper The University of Florida Sparse Matrix Collection:
“The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of domains, include those arising from problems with underlying 2D or 3D geometry (such 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 (such as optimization, circuit simulation, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, power networks, and other networks and graphs). The collection is widely used by the sparse matrix algorithms community for the development and performance evaluation of sparse matrix algorithms. The collection includes software for accessing and managing the collection, from MATLAB, Fortran, and C.”
The University of Florida Sparse Matrix Collection. Site maintained by Tim Davis and Yifan Hu, AT&T Research.
DOWNLOAD a paper describing the collection.
....................................
