Description of fast matrix multiplication algorithm: ⟨24×25×26:8417⟩

Algorithm type

[[1, 1, 1]$125,[1, 1, 2]$173,[1, 1, 3]$1060,[1, 2, 1]$95,[1, 2, 2]$11,[1, 3, 1]$45,[2, 1, 1]$12,[2, 1, 2]$1,[2, 1, 3]$11,[2, 2, 1]$73,[2, 2, 2]$665,[2, 2, 3]$231,[2, 3, 1]$92,[2, 3, 2]$946,[3, 2, 1]$56,[3, 2, 2]$242,[3, 2, 3]$231,[3, 3, 1]$1015,[3, 3, 3]$3333]

Algorithm definition

The algorithm ⟨24×25×26:8417⟩ 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