Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11428831_45 | International Conference on Computational Science (1) |
Keywords | Field | DocType |
java sparse array,sparse matrix,storage format,performance evaluation,popular format,matrix-vector multiplication operation,data structure,sparse matrices,multiplication operator | Data structure,Sparse array,Matrix calculus,Storage structure,Computer data storage,Computer science,Parallel computing,Multiplication,Java,Sparse matrix | Conference |
Volume | ISSN | ISBN |
3514 | 0302-9743 | 3-540-26032-3 |
Citations | PageRank | References |
3 | 0.53 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikel Luján | 1 | 540 | 46.40 |
| Anila Usman | 2 | 31 | 3.49 |
| Patrick Hardie | 3 | 3 | 0.53 |
| T. L. Freeman | 4 | 83 | 12.72 |
| John R. Gurd | 5 | 323 | 53.83 |