论文信息 - Storage Formats for Sparse Matrices in Java

Storage Formats for Sparse Matrices in Java

Many storage formats (or data structures) have been proposed to represent sparse matrices. This paper presents a performance evaluation in Java comparing eight of the most popular formats plus one recently proposed specifically for Java (by Gundersen and Steihaug [6] – Java Sparse Array) using the matrix-vector multiplication operation.

Mikel Luján | John R. Gurd | T. L. Freeman | Anila Usman | Patrick Hardie

[1] Richard W. Vuduc,et al. Sparsity: Optimization Framework for Sparse Matrix Kernels , 2004, Int. J. High Perform. Comput. Appl..

[2] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .

[3] Iain S. Duff,et al. Direct methods for sparse matrices27100 , 1986 .

[4] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[5] Udo W. Pooch,et al. A Survey of Indexing Techniques for Sparse Matrices , 1973, CSUR.

[6] Trond Steihaug,et al. Data structures in Java for matrix computations , 2004, Concurr. Pract. Exp..

[7] Iain S. Duff,et al. An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum , 2002, TOMS.