Description of fast matrix multiplication algorithm: ⟨26×27×28:10297⟩

Algorithm type

[[1, 1, 1]$135,[1, 1, 2]$188,[1, 1, 3]$1252,[1, 2, 1]$103,[1, 2, 2]$12,[1, 3, 1]$49,[2, 1, 1]$13,[2, 1, 2]$1,[2, 1, 3]$12,[2, 2, 1]$79,[2, 2, 2]$773,[2, 2, 3]$276,[2, 3, 1]$100,[2, 3, 2]$1128,[3, 2, 1]$61,[3, 2, 2]$288,[3, 2, 3]$276,[3, 3, 1]$1203,[3, 3, 3]$4348]

Algorithm definition

The algorithm ⟨26×27×28:10297⟩ 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