Description of fast matrix multiplication algorithm: ⟨12×18×23:2920⟩

Algorithm type

32 X^{8} Y^{9} Z^{9} + 48 X^{4} Y^{9} Z^{9} + 16 X^{4} Y^{9} Z^{6} + 24 X^{2} Y^{9} Z^{6} + 288 X^{4} Y^{6} Z^{6} + 16 X^{8} Y^{3} Z^{3} + 48 X^{2} Y^{9} Z^{3} + 432 X^{2} Y^{6} Z^{6} + 72 X Y^{9} Z^{3} + 48 X^{2} Y^{6} Z^{3} + 24 X^{4} Y^{3} Z^{3} + 72 X Y^{6} Z^{3} + 720 X^{2} Y^{3} Z^{3} + 1080 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×18×23:2920⟩ is the projection [[0, 0], [24]] of ⟨12×18×24:2920⟩.

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