Description of fast matrix multiplication algorithm: ⟨10×21×25:3175⟩

Algorithm type

5 X^{4} Y^{4} Z^{6} + 235 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{6} Z^{3} + 5 X^{6} Y^{2} Z^{2} + 5 X^{4} Y^{2} Z^{4} + 94 X^{2} Y^{6} Z^{2} + 15 X^{2} Y^{2} Z^{6} + 6 X^{2} Y^{4} Z^{3} + 95 X^{4} Y^{2} Z^{2} + 382 X^{2} Y^{4} Z^{2} + 45 X^{2} Y^{2} Z^{4} + 40 X Y^{6} Z + 2 X^{3} Y^{3} Z + 2 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 6 X Y^{3} Z^{3} + 6 X^{3} Y^{2} Z + 38 X^{2} Y^{3} Z + 700 X^{2} Y^{2} Z^{2} + 120 X Y^{4} Z + 18 X Y^{3} Z^{2} + 18 X Y^{2} Z^{3} + 12 X^{3} Y Z + 114 X^{2} Y^{2} Z + 12 X^{2} Y Z^{2} + 52 X Y^{3} Z + 54 X Y^{2} Z^{2} + 36 X Y Z^{3} + 228 X^{2} Y Z + 396 X Y^{2} Z + 108 X Y Z^{2} + 312 X Y Z

Algorithm definition

The algorithm ⟨10×21×25:3175⟩ is the (Kronecker) tensor product of ⟨2×3×5:25⟩ 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