Description of fast matrix multiplication algorithm: ⟨10×10×26:1659⟩

Algorithm type

X^{6} Y^{4} Z^{4} + 87 X^{4} Y^{4} Z^{4} + 5 X^{6} Y^{2} Z^{2} + 2 X^{4} Y^{2} Z^{4} + 3 X^{2} Y^{6} Z^{2} + X^{2} Y^{4} Z^{4} + 4 X^{2} Y^{2} Z^{6} + 21 X^{4} Y^{2} Z^{2} + 34 X^{2} Y^{4} Z^{2} + 32 X^{2} Y^{2} Z^{4} + 6 X^{3} Y^{2} Z^{2} + 569 X^{2} Y^{2} Z^{2} + 30 X^{3} Y Z + 12 X^{2} Y Z^{2} + 18 X Y^{3} Z + 6 X Y^{2} Z^{2} + 24 X Y Z^{3} + 126 X^{2} Y Z + 204 X Y^{2} Z + 192 X Y Z^{2} + 282 X Y Z

Algorithm definition

The algorithm ⟨10×10×26:1659⟩ is the (Kronecker) tensor product of ⟨5×5×13:237⟩ 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