The University of Florida Sparse Matrix Collection

For a general-audience description of the matrices and images posted here, see our short note on Visualizing Sparse Matrices.

Click here for a presentation at the Harn Museum, University of Florida

(click reload to see a replay of the animation).


Maintained by Tim Davis and Yifan Hu, Yahoo! Labs.

From the abstract of the paper The University of Florida Sparse Matrix Collection:

The collection also appears as a Public Data Set hosted by Amazon Web Services, at aws.amazon.com:

Sample Gallery of the University of Florida Sparse Matrix Collection:

Click on the thumbnails below for a close-up.

The images above of matrices in the UF Sparse Matrix Collection were created by Yifan Hu, AT&T. As of July 2011, it contains 2547 problems (some of which are sequences of dozens of matrices). The largest has a dimension of 118 million, and the matrix with the most nonzero entries has almost 2 billion of them. 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.

This collection is managed by Tim Davis, with images created by Yifan Hu. ``Editors'' of other collections are attributed, via the Problem.ed field in each problem set. Problem.author is the matrix creator. Other collections are always welcome.

Click here for a paper describing the collection.

Search the collection

UFgui Java interface:

The UFget package includes a Java program (UFgui) for browsing and downloading the matrices in any format on any platform. Below is a screenshot (click on it to download the code):

UFgui screenshot

Browse the collection:

Statistics:

MATLAB and stand-alone Java GUI interfaces (and links to Python interfaces):

DIMACS10

Software:

References:

To submit matrices to this collection:

Sources of some matrices and related links


Graph drawings, by Yifan Hu

Yifan Hu, at Yahoo! Labs has created a graph drawing program that can generate truly beautiful drawings of a large graph, based solely on the connectivity (that is, a sparse matrix). Take a look at his drawings of the matrices in the UF Sparse Matrix Collection. Each square matrix in the UF Sparse Matrix Collection has a link to his graph drawings; clicking on them will bring up his web page for that matrix, including a link to a higher resolution image.

For a demo of how Yifan's algorithm works, see the GraphPlot function, which he wrote for Mathematica, or you can view it here by right-clicking the figure below and selecting "Play". (or just click "reload" on your browser).

Below is Yifan Hu's graph drawing of the Chen/pkustk01 matrix that I obtained from Pu Chen, Beijing University. The matrix is a model of the Beijing Botanical Garden Conservatory. Overlayed on top of the graph is a picture of the actual building.