Description of fast matrix multiplication algorithm: ⟨4×18×21:1004⟩

Algorithm type

9 X^{4} Y^{6} Z^{4} + 3 X^{2} Y^{10} Z^{2} + 42 X^{4} Y^{4} Z^{4} + 21 X^{2} Y^{8} Z^{2} + 6 X Y^{10} Z + 36 X^{2} Y^{6} Z^{2} + 42 X Y^{8} Z + 111 X^{2} Y^{4} Z^{2} + 36 X Y^{6} Z + 18 X^{2} Y^{3} Z^{2} + 6 X Y^{5} Z + 166 X^{2} Y^{2} Z^{2} + 96 X Y^{4} Z + 2 X^{3} Y Z + 2 X^{2} Y Z^{2} + 37 X Y^{3} Z + 2 X Y Z^{3} + 4 X^{2} Y Z + 204 X Y^{2} Z + 4 X Y Z^{2} + 157 X Y Z

Algorithm definition

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