Description of fast matrix multiplication algorithm: ⟨20×21×25:5969⟩

Algorithm type

13 X^{4} Y^{4} Z^{6} + 2 X^{2} Y^{2} Z^{9} + 611 X^{4} Y^{4} Z^{4} + X^{4} Y^{2} Z^{6} + 2 X^{2} Y^{4} Z^{6} + 3 X^{9} Y Z + 3 X^{6} Y^{2} Z^{3} + 4 X^{2} Y^{6} Z^{3} + 6 X Y Z^{9} + 154 X^{6} Y^{2} Z^{2} + 60 X^{4} Y^{2} Z^{4} + 188 X^{2} Y^{6} Z^{2} + 94 X^{2} Y^{4} Z^{4} + 141 X^{2} Y^{2} Z^{6} + 4 X^{6} Y Z^{2} + 3 X^{4} Y^{2} Z^{3} + X^{4} Y Z^{4} + 6 X^{2} Y^{4} Z^{3} + 5 X^{2} Y Z^{6} + 6 X Y^{2} Z^{6} + 60 X^{6} Y Z + 388 X^{4} Y^{2} Z^{2} + 542 X^{2} Y^{4} Z^{2} + 495 X^{2} Y^{2} Z^{4} + 80 X Y^{6} Z + 42 X Y Z^{6} + 22 X^{4} Y Z^{2} + 4 X^{3} Y^{3} Z + 2 X^{3} Y^{2} Z^{2} + 11 X^{3} Y Z^{3} + 4 X^{2} Y^{3} Z^{2} + 5 X^{2} Y^{2} Z^{3} + 17 X^{2} Y Z^{4} + 40 X Y^{4} Z^{2} + 12 X Y^{3} Z^{3} + 18 X Y^{2} Z^{4} + 57 X^{4} Y Z + 66 X^{3} Y^{2} Z + 35 X^{3} Y Z^{2} + 76 X^{2} Y^{3} Z + 637 X^{2} Y^{2} Z^{2} + 47 X^{2} Y Z^{3} + 120 X Y^{4} Z + 36 X Y^{3} Z^{2} + 58 X Y^{2} Z^{3} + 72 X Y Z^{4} + 83 X^{3} Y Z + 174 X^{2} Y^{2} Z + 210 X^{2} Y Z^{2} + 104 X Y^{3} Z + 266 X Y^{2} Z^{2} + 67 X Y Z^{3} + 173 X^{2} Y Z + 256 X Y^{2} Z + 253 X Y Z^{2} + 130 X Y Z

Algorithm definition

The algorithm ⟨20×21×25:5969⟩ is the (Kronecker) tensor product of ⟨4×3×5:47⟩ with ⟨5×7×5:127⟩.

Algorithm description

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