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

Algorithm type

[[1, 1, 1]$115,[1, 1, 2]$158,[1, 1, 3]$884,[1, 2, 1]$87,[1, 2, 2]$10,[1, 3, 1]$41,[2, 1, 1]$11,[2, 1, 2]$1,[2, 1, 3]$10,[2, 2, 1]$67,[2, 2, 2]$565,[2, 2, 3]$190,[2, 3, 1]$84,[2, 3, 2]$780,[3, 2, 1]$51,[3, 2, 2]$200,[3, 2, 3]$190,[3, 3, 1]$843,[3, 3, 3]$2490]

Algorithm definition

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