Description of fast matrix multiplication algorithm: ⟨25×28×28:10206⟩

Algorithm type

[[1, 1, 1]$106,[1, 1, 2]$222,[1, 1, 3]$1178,[1, 2, 1]$84,[1, 2, 2]$33,[1, 3, 1]$216,[2, 2, 1]$86,[2, 2, 2]$458,[2, 2, 3]$253,[2, 3, 1]$169,[2, 3, 2]$1876,[3, 2, 1]$22,[3, 2, 2]$253,[3, 3, 1]$1156,[3, 3, 3]$4094]

Algorithm definition

The algorithm ⟨25×28×28:10206⟩ 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