Description of fast matrix multiplication algorithm: ⟨14×20×26:4298⟩

Algorithm type

13 X^{8} Y^{8} Z^{8} + 6 X^{8} Y^{8} Z^{6} + 4 X^{6} Y^{8} Z^{8} + X^{8} Y^{6} Z^{6} + 12 X^{6} Y^{8} Z^{6} + 2 X^{4} Y^{8} Z^{6} + 3 X^{8} Y^{4} Z^{4} + 14 X^{4} Y^{8} Z^{4} + 9 X^{4} Y^{4} Z^{8} + 3 X^{8} Y^{4} Z^{2} + 2 X^{6} Y^{4} Z^{4} + 6 X^{4} Y^{6} Z^{4} + 5 X^{4} Y^{4} Z^{6} + 5 X^{2} Y^{8} Z^{4} + X^{2} Y^{4} Z^{8} + 2 X^{6} Y^{2} Z^{4} + X^{4} Y^{6} Z^{2} + 256 X^{4} Y^{4} Z^{4} + 2 X^{4} Y^{2} Z^{6} + 6 X^{2} Y^{8} Z^{2} + 3 X^{2} Y^{4} Z^{6} + 36 X^{4} Y^{4} Z^{3} + 24 X^{3} Y^{4} Z^{4} + 12 X^{6} Y^{2} Z^{2} + 11 X^{4} Y^{4} Z^{2} + 6 X^{4} Y^{3} Z^{3} + 4 X^{4} Y^{2} Z^{4} + 72 X^{3} Y^{4} Z^{3} + 15 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{4} + 18 X^{2} Y^{2} Z^{6} + 12 X^{2} Y^{4} Z^{3} + 52 X^{4} Y^{2} Z^{2} + 172 X^{2} Y^{4} Z^{2} + 122 X^{2} Y^{2} Z^{4} + 18 X^{4} Y^{2} Z + 12 X^{3} Y^{2} Z^{2} + 36 X^{2} Y^{3} Z^{2} + 30 X^{2} Y^{2} Z^{3} + 30 X Y^{4} Z^{2} + 6 X Y^{2} Z^{4} + 12 X^{3} Y Z^{2} + 6 X^{2} Y^{3} Z + 1134 X^{2} Y^{2} Z^{2} + 12 X^{2} Y Z^{3} + 36 X Y^{4} Z + 18 X Y^{2} Z^{3} + 72 X^{3} Y Z + 66 X^{2} Y^{2} Z + 24 X^{2} Y Z^{2} + 90 X Y^{3} Z + 120 X Y^{2} Z^{2} + 108 X Y Z^{3} + 204 X^{2} Y Z + 528 X Y^{2} Z + 408 X Y Z^{2} + 396 X Y Z

Algorithm definition

The algorithm ⟨14×20×26:4298⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨7×10×13:614⟩.

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