Description of fast matrix multiplication algorithm: ⟨11×24×27:4160⟩

Algorithm type

32 X^{9} Y^{12} Z^{6} + 32 X^{8} Y^{12} Z^{6} + 48 X^{9} Y^{12} Z^{3} + 48 X^{8} Y^{12} Z^{3} + 64 X^{3} Y^{12} Z^{2} + 384 X^{6} Y^{6} Z^{4} + 96 X^{3} Y^{12} Z + 128 X^{5} Y^{6} Z^{4} + 576 X^{6} Y^{6} Z^{2} + 192 X^{5} Y^{6} Z^{2} + 960 X^{3} Y^{3} Z^{2} + 1440 X^{3} Y^{3} Z + 64 X^{2} Y^{3} Z^{2} + 96 X^{2} Y^{3} Z

Algorithm definition

The algorithm ⟨11×24×27:4160⟩ is the projection [[12, 0], [0]] of ⟨12×24×27:4160⟩.

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