Efficient algorithm for sparse matrix computations
A new representation of a sparse matrix is introduced that is very efficient for matrix multiplication when the non-zero elements are partially or fully adjacent to one another as in band or triangular matrices. Space complexity is better than that of the existing algorithms when the number of the groups of adjacent non-zero elements is less than two-thirds of the total number of non-zero elements. Time complexity is better or much better than that of existing algorithms depending on the number of groups of non-zero adjacent elements in the factor matrices.
Publication Source (Journal or Book title)
Applied Computing: Technological Challenges of the 1990's
Park, S., Draayer, J., & Zheng, S. (1992). Efficient algorithm for sparse matrix computations. Applied Computing: Technological Challenges of the 1990's, 919-926. https://doi.org/10.1145/130069.130108