Description of fast matrix multiplication algorithm: ⟨29×32×32:14738⟩

Algorithm type

6606 X^{3} Y^{3} Z^{3} + 1572 X^{3} Y^{3} Z + 351 X^{3} Y^{2} Z^{2} + 2580 X^{2} Y^{3} Z^{2} + 351 X^{2} Y^{2} Z^{3} + 26 X^{3} Y^{2} Z + 197 X^{2} Y^{3} Z + 590 X^{2} Y^{2} Z^{2} + 100 X^{2} Y^{2} Z + 252 X Y^{3} Z + 39 X Y^{2} Z^{2} + 1598 X Y Z^{3} + 96 X Y^{2} Z + 258 X Y Z^{2} + 122 X Y Z

Algorithm definition

The algorithm ⟨29×32×32:14738⟩ 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