Skip to main content
Conference ProceedingsOPEN ACCESS

Storage formats for sparse matrices in Java

Lecture Notes in Computer Science (2005) 3514(I) 364-371
DOI: 10.1007/11428831_45
6Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Luján, M., Usman, A., Hardie, P., Freeman, T. L., & Gurd, J. R. (2005). Storage formats for sparse matrices in Java. In Lecture Notes in Computer Science (Vol. 3514, pp. 364–371). Springer Verlag. https://doi.org/10.1007/11428831_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free