Description of fast matrix multiplication algorithm: ⟨15×18×29:4400⟩

Algorithm type

640 X^{4} Y^{6} Z^{6} + 48 X^{2} Y^{9} Z^{3} + 960 X^{2} Y^{6} Z^{6} + 32 X^{2} Y^{3} Z^{9} + 16 X^{4} Y^{6} Z^{3} + 16 X^{4} Y^{3} Z^{6} + 72 X Y^{9} Z^{3} + 48 X Y^{3} Z^{9} + 48 X^{6} Y^{3} Z^{3} + 248 X^{2} Y^{6} Z^{3} + 216 X^{2} Y^{3} Z^{6} + 208 X^{4} Y^{3} Z^{3} + 336 X Y^{6} Z^{3} + 288 X Y^{3} Z^{6} + 72 X^{3} Y^{3} Z^{3} + 648 X^{2} Y^{3} Z^{3} + 504 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨15×18×29:4400⟩ is the projection [[0, 0], [30]] of ⟨15×18×30:4400⟩.

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