Fast Sparse Matrix Multiplication

Raphael Yuster, Uri Zwick

Research output: Contribution to journalArticlepeer-review

Abstract

Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m nonzero elements. We present a new algorithm that multiplies A and B using O(m0.7n1.2 + n2+o(1)) algebraic operations (i.e., multiplications, additions and subtractions) over R. The naïve matrix multiplication algorithm, on the other hand, may need to perform Ω(mn) operations to accomplish the same task. For m ≤n1.14, the new algorithm performs an almost optimal number of only n2+o(1) operations. For m ≤ n1.68, the new algorithm is also faster than the best known matrix multiplication algorithm for dense matrices which uses O(n2.38) algebraic operations. The new algorithm is obtained using a surprisingly straightforward combination of a simple combinatorial idea and existing fast rectangular matrix multiplication algorithms.We also obtain improved algorithms for the multiplication of more than two sparse matrices. As the known fast rectangular matrix multiplication algorithms are far from being practical, our result, at least for now, is only of theoretical value.

Original languageEnglish
Pages (from-to)2-13
Number of pages12
JournalACM Transactions on Algorithms
Volume1
Issue number1
DOIs
StatePublished - 2005

Keywords

  • Algorithms
  • Matrix multiplication
  • Sparse matrices
  • Theory

Fingerprint

Dive into the research topics of 'Fast Sparse Matrix Multiplication'. Together they form a unique fingerprint.

Cite this