Description of fast matrix multiplication algorithm: ⟨23×26×26:8332⟩

Algorithm type

[[1, 1, 1]$98,[1, 1, 2]$204,[1, 1, 3]$992,[1, 2, 1]$78,[1, 2, 2]$30,[1, 3, 1]$198,[2, 2, 1]$79,[2, 2, 2]$398,[2, 2, 3]$210,[2, 3, 1]$155,[2, 3, 2]$1566,[3, 2, 1]$20,[3, 2, 2]$210,[3, 3, 1]$972,[3, 3, 3]$3122]

Algorithm definition

The algorithm ⟨23×26×26:8332⟩ 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