Description of fast matrix multiplication algorithm: ⟨10×14×14:1232⟩

Algorithm type

X^{6} Y^{4} Z^{4} + 10 X^{4} Y^{6} Z^{4} + X^{2} Y^{2} Z^{10} + 58 X^{4} Y^{4} Z^{4} + 3 X^{2} Y^{2} Z^{8} + 4 X^{6} Y^{2} Z^{2} + X^{4} Y^{4} Z^{2} + 8 X^{2} Y^{6} Z^{2} + 7 X^{2} Y^{4} Z^{4} + X^{2} Y^{2} Z^{6} + 19 X^{4} Y^{2} Z^{2} + 25 X^{2} Y^{4} Z^{2} + 15 X^{2} Y^{2} Z^{4} + 6 X^{3} Y^{2} Z^{2} + 60 X^{2} Y^{3} Z^{2} + 6 X Y Z^{5} + 371 X^{2} Y^{2} Z^{2} + 18 X Y Z^{4} + 24 X^{3} Y Z + 6 X^{2} Y^{2} Z + 48 X Y^{3} Z + 42 X Y^{2} Z^{2} + 6 X Y Z^{3} + 114 X^{2} Y Z + 150 X Y^{2} Z + 90 X Y Z^{2} + 138 X Y Z

Algorithm definition

The algorithm ⟨10×14×14:1232⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×7×7:176⟩.

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