Description of fast matrix multiplication algorithm: ⟨27×32×32:14446⟩

Algorithm type

[[1, 1, 1]$118,[1, 1, 2]$346,[1, 1, 3]$1382,[1, 2, 1]$160,[1, 2, 2]$55,[1, 3, 1]$650,[2, 2, 1]$114,[2, 2, 2]$632,[2, 2, 3]$275,[2, 3, 1]$287,[2, 3, 2]$3470,[3, 2, 1]$22,[3, 2, 2]$275,[3, 3, 1]$1360,[3, 3, 3]$5300]

Algorithm definition

The algorithm ⟨27×32×32:14446⟩ 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