Description of fast matrix multiplication algorithm: ⟨21×22×22:5476⟩

Algorithm type

[[1, 1, 1]$86,[1, 1, 2]$104,[1, 1, 3]$820,[1, 2, 1]$22,[1, 2, 2]$10,[1, 3, 1]$20,[2, 2, 1]$53,[2, 2, 2]$260,[2, 2, 3]$190,[2, 3, 1]$61,[2, 3, 2]$560,[3, 2, 1]$20,[3, 2, 2]$190,[3, 3, 1]$800,[3, 3, 3]$2280]

Algorithm definition

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