PERFORMANCE COMPARISON OF STORAGE FORMATS FOR SPARSE MATRICES
Milan B. Tasić · 2009
The sparse data structure represents a matrix in space proportional to the number of non-zero entries. Many storage formats have been proposed to represent sparse matrices. In this paper we evaluate and compare the storage efficiency of various sparse matrix storage formats, and consider the performance results of matrix-vector multiplication using these storage formats.