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.
Chapter PDF
Similar content being viewed by others
References
The matrix market, http://math.nist.gov/MatrixMarket/
Barrett, R., et al.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia (1994)
Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford (1986)
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)
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)
Gundersen, G., Steihaug, T.: Data structures in Java for matrix computations. Concurrency and Computation: Practice and Experience 16(8), 799–815 (2004)
Pooch, U.W., Nieder, A.: A survey of indexing techniques for sparse matrices. ACM Computing Surveys 5(2), 109–133 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luján, M., Usman, A., Hardie, P., Freeman, T.L., Gurd, J.R. (2005). Storage Formats for Sparse Matrices in Java. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428831_45
Download citation
DOI: https://doi.org/10.1007/11428831_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26032-5
Online ISBN: 978-3-540-32111-8
eBook Packages: Computer ScienceComputer Science (R0)