Description of fast matrix multiplication algorithm: ⟨22×24×24:6802⟩

Algorithm type

[[1, 1, 1]$92,[1, 1, 2]$152,[1, 1, 3]$904,[1, 2, 1]$48,[1, 2, 2]$20,[1, 3, 1]$84,[2, 2, 1]$66,[2, 2, 2]$326,[2, 2, 3]$200,[2, 3, 1]$106,[2, 3, 2]$1020,[3, 2, 1]$20,[3, 2, 2]$200,[3, 3, 1]$884,[3, 3, 3]$2680]

Algorithm definition

The algorithm ⟨22×24×24:6802⟩ 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