Storage formats for sparse matrices in java

Authors:
Mikel Luján;Anila Usman;Patrick Hardie;T. L. Freeman;John R. Gurd
Affiliations:
Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 5
Cited 2

Direct methods for sparse matrices

Direct methods for sparse matrices
A Survey of Indexing Techniques for Sparse Matrices

ACM Computing Surveys (CSUR)
An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum

ACM Transactions on Mathematical Software (TOMS)
Data structures in Java for matrix computations: Research Articles

Concurrency and Computation: Practice & Experience
Sparsity: Optimization Framework for Sparse Matrix Kernels

International Journal of High Performance Computing Applications

Performance evaluation of storage formats for sparse matrices in fortran

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Performance evaluation of sparse matrix products in UPC

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.