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

Algorithm type

3 X^{8} Y^{8} Z^{8} + X^{8} Y^{6} Z^{8} + 2 X^{6} Y^{6} Z^{8} + 2 X^{4} Y^{10} Z^{4} + 4 X^{4} Y^{8} Z^{4} + 2 X^{4} Y^{6} Z^{4} + 56 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{6} Z^{4} + 6 X^{4} Y^{3} Z^{4} + 2 X^{4} Y^{2} Z^{4} + 12 X^{3} Y^{3} Z^{4} + 18 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{5} Z^{2} + 48 X^{2} Y^{4} Z^{2} + 12 X^{2} Y^{3} Z^{2} + 294 X^{2} Y^{2} Z^{2} + 12 X Y^{3} Z^{2} + 12 X^{2} Y Z^{2} + 108 X Y^{3} Z + 144 X Y^{2} Z + 396 X Y Z

Algorithm definition

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

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