Description of fast matrix multiplication algorithm: ⟨10×10×20:1246⟩

Algorithm type

X^{2} Y^{8} Z^{4} + X^{4} Y^{6} Z^{2} + 72 X^{4} Y^{4} Z^{4} + 2 X^{4} Y^{2} Z^{6} + X^{2} Y^{2} Z^{8} + X^{4} Y^{4} Z^{2} + X^{4} Y^{2} Z^{4} + 2 X^{2} Y^{6} Z^{2} + 9 X^{4} Y^{2} Z^{2} + 36 X^{2} Y^{4} Z^{2} + 37 X^{2} Y^{2} Z^{4} + 6 X Y^{4} Z^{2} + 6 X^{2} Y^{3} Z + 447 X^{2} Y^{2} Z^{2} + 12 X^{2} Y Z^{3} + 6 X Y Z^{4} + 6 X^{2} Y^{2} Z + 6 X^{2} Y Z^{2} + 12 X Y^{3} Z + 54 X^{2} Y Z + 216 X Y^{2} Z + 222 X Y Z^{2} + 90 X Y Z

Algorithm definition

The algorithm ⟨10×10×20:1246⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×5×10:178⟩.

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