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.
ER -
%0 Journal Article
%1 mikel2005storage
%A Luján, Mikel
%A Usman, Anila
%A Hardie, Patrick
%A Freeman, T.L.
%A Gurd, John
%D 2005
%J Computational Science – ICCS 2005
%K evaluation java matrix programming sparse
%P 364--371
%T Storage Formats for Sparse Matrices in Java
%U http://dx.doi.org/10.1007/11428831_45
%X 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.
ER -
@article{mikel2005storage,
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.
ER -},
added-at = {2009-08-10T15:28:28.000+0200},
author = {Luján, Mikel and Usman, Anila and Hardie, Patrick and Freeman, T.L. and Gurd, John},
biburl = {https://www.bibsonomy.org/bibtex/2ba051dc3799456ac8b6ae74b75f7e54b/folke},
description = {SpringerLink - Book Chapter},
interhash = {b8bf03d4eba50d021e57b044cf7bb743},
intrahash = {ba051dc3799456ac8b6ae74b75f7e54b},
journal = {Computational Science – ICCS 2005},
keywords = {evaluation java matrix programming sparse},
pages = {364--371},
timestamp = {2009-08-10T15:28:28.000+0200},
title = {Storage Formats for Sparse Matrices in Java},
url = {http://dx.doi.org/10.1007/11428831_45},
year = 2005
}