Description of fast matrix multiplication algorithm: ⟨26×28×28:10326⟩

Algorithm type

[[1, 1, 1]$108,[1, 1, 2]$180,[1, 1, 3]$1276,[1, 2, 1]$56,[1, 2, 2]$24,[1, 3, 1]$100,[2, 2, 1]$78,[2, 2, 2]$438,[2, 2, 3]$288,[2, 3, 1]$126,[2, 3, 2]$1464,[3, 2, 1]$24,[3, 2, 2]$288,[3, 3, 1]$1252,[3, 3, 3]$4624]

Algorithm definition

The algorithm ⟨26×28×28:10326⟩ is taken from:

Optimization techniques for small matrix multiplication. Theoretical Computer Science, 412(22):2219--2236, May 2011. [ DOI ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.

Back to main table