Description of fast matrix multiplication algorithm: ⟨15×17×21:3200⟩

Algorithm type

32 X^{6} Y^{6} Z^{8} + 64 X^{6} Y^{6} Z^{6} + 368 X^{6} Y^{6} Z^{4} + 96 X^{6} Y^{6} Z^{3} + 16 X^{3} Y^{6} Z^{6} + 480 X^{6} Y^{6} Z^{2} + 32 X^{3} Y^{9} Z^{2} + 48 X^{3} Y^{3} Z^{8} + 48 X^{3} Y^{9} Z + 64 X^{3} Y^{6} Z^{4} + 24 X^{3} Y^{6} Z^{3} + 112 X^{3} Y^{3} Z^{6} + 240 X^{3} Y^{6} Z^{2} + 216 X^{3} Y^{6} Z + 216 X^{3} Y^{3} Z^{4} + 168 X^{3} Y^{3} Z^{3} + 520 X^{3} Y^{3} Z^{2} + 456 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨15×17×21:3200⟩ is the projection [[0, 18], [0]] of ⟨15×18×21:3200⟩.

Algorithm description

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