Description of fast matrix multiplication algorithm: ⟨8×14×14:1008⟩

Algorithm type

X^{4} Y^{10} Z^{2} + 2 X^{4} Y^{8} Z^{2} + 8 X^{4} Y^{6} Z^{4} + X^{4} Y^{6} Z^{2} + 44 X^{4} Y^{4} Z^{4} + X^{2} Y^{8} Z^{2} + X^{2} Y^{6} Z^{4} + X^{4} Y^{4} Z^{2} + X^{4} Y^{2} Z^{4} + 6 X^{2} Y^{6} Z^{2} + X^{2} Y^{4} Z^{4} + X^{2} Y^{2} Z^{6} + 12 X^{4} Y^{2} Z^{2} + 6 X^{2} Y^{5} Z + 21 X^{2} Y^{4} Z^{2} + 13 X^{2} Y^{2} Z^{4} + 12 X^{2} Y^{4} Z + 48 X^{2} Y^{3} Z^{2} + 6 X^{2} Y^{3} Z + 294 X^{2} Y^{2} Z^{2} + 6 X Y^{4} Z + 6 X Y^{3} Z^{2} + 6 X^{2} Y^{2} Z + 6 X^{2} Y Z^{2} + 36 X Y^{3} Z + 6 X Y^{2} Z^{2} + 6 X Y Z^{3} + 72 X^{2} Y Z + 126 X Y^{2} Z + 78 X Y Z^{2} + 180 X Y Z

Algorithm definition

The algorithm ⟨8×14×14:1008⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×7×7:144⟩.

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