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

Algorithm type

2 X^{8} Y^{2} Z^{2} + X^{4} Y^{6} Z^{2} + 73 X^{4} Y^{4} Z^{4} + X^{4} Y^{2} Z^{6} + 2 X^{6} Y^{2} Z^{2} + 2 X^{4} Y^{4} Z^{2} + 2 X^{4} Y^{2} Z^{4} + 7 X^{2} Y^{6} Z^{2} + 3 X^{2} Y^{4} Z^{4} + 7 X^{2} Y^{2} Z^{6} + 26 X^{4} Y^{2} Z^{2} + 25 X^{2} Y^{4} Z^{2} + 23 X^{2} Y^{2} Z^{4} + 12 X^{4} Y Z + 6 X^{2} Y^{3} Z + 466 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 12 X^{3} Y Z + 12 X^{2} Y^{2} Z + 12 X^{2} Y Z^{2} + 42 X Y^{3} Z + 18 X Y^{2} Z^{2} + 42 X Y Z^{3} + 156 X^{2} Y Z + 150 X Y^{2} Z + 138 X Y Z^{2} + 168 X Y Z

Algorithm definition

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

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