Description of fast matrix multiplication algorithm: ⟨10×15×18:1650⟩

Algorithm type

120 X^{4} Y^{4} Z^{4} + 6 X^{6} Y^{2} Z^{2} + 3 X^{4} Y^{2} Z^{4} + 9 X^{2} Y^{6} Z^{2} + 3 X^{2} Y^{4} Z^{4} + 9 X^{2} Y^{2} Z^{6} + 36 X^{4} Y^{2} Z^{2} + 282 X^{2} Y^{4} Z^{2} + 39 X^{2} Y^{2} Z^{4} + 18 X Y^{6} Z + 6 X Y^{4} Z^{2} + 12 X^{3} Y^{2} Z + 309 X^{2} Y^{2} Z^{2} + 84 X Y^{4} Z + 18 X Y^{2} Z^{3} + 12 X^{3} Y Z + 72 X^{2} Y^{2} Z + 6 X^{2} Y Z^{2} + 18 X Y^{3} Z + 84 X Y^{2} Z^{2} + 18 X Y Z^{3} + 72 X^{2} Y Z + 210 X Y^{2} Z + 78 X Y Z^{2} + 126 X Y Z

Algorithm definition

The algorithm ⟨10×15×18:1650⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨5×5×6:110⟩.

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