Description of fast matrix multiplication algorithm: ⟨28×32×32:14596⟩

Algorithm type

5928 X^{3} Y^{3} Z^{3} + 1464 X^{3} Y^{3} Z + 312 X^{3} Y^{2} Z^{2} + 3072 X^{2} Y^{3} Z^{2} + 312 X^{2} Y^{2} Z^{3} + 24 X^{3} Y^{2} Z + 244 X^{2} Y^{3} Z + 612 X^{2} Y^{2} Z^{2} + 108 X^{2} Y^{2} Z + 432 X Y^{3} Z + 48 X Y^{2} Z^{2} + 1488 X Y Z^{3} + 128 X Y^{2} Z + 304 X Y Z^{2} + 120 X Y Z

Algorithm definition

The algorithm ⟨28×32×32:14596⟩ 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