Description of fast matrix multiplication algorithm: ⟨11×18×21:2520⟩

Algorithm type

96 X^{6} Y^{6} Z^{6} + 224 X^{6} Y^{6} Z^{4} + 144 X^{6} Y^{6} Z^{3} + 16 X^{5} Y^{6} Z^{4} + 400 X^{6} Y^{6} Z^{2} + 32 X^{3} Y^{3} Z^{8} + 96 X^{6} Y^{6} Z + 56 X^{5} Y^{6} Z^{2} + 48 X^{5} Y^{6} Z + 192 X^{3} Y^{3} Z^{6} + 240 X^{3} Y^{3} Z^{4} + 288 X^{3} Y^{3} Z^{3} + 448 X^{3} Y^{3} Z^{2} + 240 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨11×18×21:2520⟩ is the projection [[12, 0], [0]] of ⟨12×18×21:2520⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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