ICCS 2005: Computational Science – ICCS 2005 pp 364-371 | Cite as
Storage Formats for Sparse Matrices in Java
Conference paper
Abstract
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.
Download
to read the full conference paper text
References
- 1.The matrix market, http://math.nist.gov/MatrixMarket/
- 2.Barrett, R., et al.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia (1994)Google Scholar
- 3.Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford (1986)MATHGoogle Scholar
- 4.Duff, I.S., Heroux, M.A., Pozo, R.: An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum. ACM Transactions on Mathematical Software 28(2), 239–267 (2002)MATHCrossRefMathSciNetGoogle Scholar
- 5.Im, E.-J., Yelick., K.A., Vuduc, R.: SPARSITY: An optimization framework for sparse matrix kernels. International Journal of High Performance Computing Applications 18(1), 135–158 (2004)CrossRefGoogle Scholar
- 6.Gundersen, G., Steihaug, T.: Data structures in Java for matrix computations. Concurrency and Computation: Practice and Experience 16(8), 799–815 (2004)CrossRefGoogle Scholar
- 7.Pooch, U.W., Nieder, A.: A survey of indexing techniques for sparse matrices. ACM Computing Surveys 5(2), 109–133 (1973)MATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2005