Description of fast matrix multiplication algorithm: ⟨10×10×22:1365⟩

Algorithm type

X^{4} Y^{4} Z^{6} + X^{2} Y^{10} Z^{2} + 79 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{8} Z^{2} + X^{2} Y^{4} Z^{6} + X^{4} Y^{2} Z^{4} + 2 X^{2} Y^{6} Z^{2} + 4 X^{2} Y^{4} Z^{4} + 2 X^{2} Y^{2} Z^{6} + 3 X^{4} Y^{2} Z^{2} + 36 X^{2} Y^{4} Z^{2} + 35 X^{2} Y^{2} Z^{4} + 6 X^{2} Y^{2} Z^{3} + 6 X Y^{5} Z + 502 X^{2} Y^{2} Z^{2} + 12 X Y^{4} Z + 6 X Y^{2} Z^{3} + 6 X^{2} Y Z^{2} + 12 X Y^{3} Z + 24 X Y^{2} Z^{2} + 12 X Y Z^{3} + 18 X^{2} Y Z + 216 X Y^{2} Z + 210 X Y Z^{2} + 168 X Y Z

Algorithm definition

The algorithm ⟨10×10×22:1365⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×5×11:195⟩.

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