Storage formats for sparse matrices in Java

Mikel Luján, Anila Usman, Patrick Hardie, T. L. Freeman, John R. Gurd

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    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.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science|Lect. Notes Comput. Sci.
    EditorsV.S. Sunderam, G.D. Albada, P.M.A. Sloot, J.J. Dongarra
    Place of PublicationBerlin
    PublisherSpringer Nature
    Pages364-371
    Number of pages7
    Volume3514
    DOIs
    Publication statusPublished - 2005
    Event5th International Conference on Computational Science - ICCS 2005 - Atlanta, GA
    Duration: 1 Jul 2005 → …

    Publication series

    NameLecture Notes in Computer Science

    Conference

    Conference5th International Conference on Computational Science - ICCS 2005
    CityAtlanta, GA
    Period1/07/05 → …

    Fingerprint

    Dive into the research topics of 'Storage formats for sparse matrices in Java'. Together they form a unique fingerprint.

    Cite this