Description of fast matrix multiplication algorithm: ⟨10×12×15:1140⟩

Algorithm type

3 X^{4} Y^{4} Z^{6} + 12 X^{8} Y^{2} Z^{2} + 69 X^{4} Y^{4} Z^{4} + 12 X^{2} Y^{8} Z^{2} + 24 X^{2} Y^{4} Z^{4} + 39 X^{2} Y^{2} Z^{6} + 24 X Y^{8} Z + 6 X^{2} Y^{4} Z^{3} + 150 X^{2} Y^{4} Z^{2} + 12 X^{2} Y^{2} Z^{4} + 24 X^{4} Y^{2} Z + 6 X^{2} Y^{2} Z^{3} + 48 X Y^{4} Z^{2} + 24 X^{4} Y Z + 183 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 78 X Y^{2} Z^{3} + 72 X Y^{2} Z^{2} + 78 X Y Z^{3} + 114 X Y^{2} Z + 24 X Y Z^{2} + 90 X Y Z

Algorithm definition

The algorithm ⟨10×12×15:1140⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨5×4×5:76⟩.

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