Description of fast matrix multiplication algorithm: ⟨19×20×20:4258⟩

Algorithm type

1632 X^{3} Y^{3} Z^{3} + 648 X^{3} Y^{3} Z + 153 X^{3} Y^{2} Z^{2} + 450 X^{2} Y^{3} Z^{2} + 153 X^{2} Y^{2} Z^{3} + 18 X^{3} Y^{2} Z + 55 X^{2} Y^{3} Z + 216 X^{2} Y^{2} Z^{2} + 48 X^{2} Y^{2} Z + 18 X Y^{3} Z + 9 X Y^{2} Z^{2} + 666 X Y Z^{3} + 20 X Y^{2} Z + 94 X Y Z^{2} + 78 X Y Z

Algorithm definition

The algorithm ⟨19×20×20:4258⟩ is the projection [[1, 0], [0]] of ⟨20×20×20:4340⟩.

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