Fast sparse matrix multiplication

Published: 1 January 1992| Version 1 | DOI: 10.17632/ydtrxpr4vw.1
S.C. Park, J.P. Draayer, S.-Q. Zheng


Abstract A new space-efficient representation for sparse matrices is introduced and a fast sparse matrix multiplication algorithm based on the new representation is presented. The scheme is very efficient when the nonzero elements of a sparse matrix are partially or fully adjacent to one another as in band or triangular matrices. The space complexity of the new representation is better than that of existing algorithms when the number of sets of adjacent nonzero elements, called segments, is less than ... Title of program: SMM Catalogue Id: ACHR_v1_0 Nature of problem Sparse matrix multiplication often arises in scientific computations. Since a sparse matrix includes many zero elements, the multiplication should not be handled in the same way as for dense matrices. The standard matrix multiplication algorithm for n x n factor matrices, represented in the usual two-dimensional array form, takes O(n^3) time. This means that when the factor matrices are very large, e.g., 1000's x 1000's, not only will the computation time be excessively long but the demands on ... Versions of this program held in the CPC repository in Mendeley Data ACHR_v1_0; SMM; 10.1016/0010-4655(92)90116-G This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method