Description of fast matrix multiplication algorithm: ⟨20×22×26:6468⟩

Algorithm type

X^{12} Y^{6} Z^{6} + 30 X^{8} Y^{8} Z^{8} + X^{8} Y^{8} Z^{6} + 16 X^{8} Y^{6} Z^{8} + X^{12} Y^{4} Z^{4} + 2 X^{8} Y^{8} Z^{4} + 3 X^{8} Y^{6} Z^{6} + 7 X^{6} Y^{6} Z^{8} + X^{12} Y^{4} Z^{2} + 2 X^{8} Y^{4} Z^{6} + X^{6} Y^{6} Z^{6} + 11 X^{8} Y^{4} Z^{4} + 14 X^{4} Y^{8} Z^{4} + 16 X^{4} Y^{4} Z^{8} + X^{8} Y^{4} Z^{2} + 4 X^{8} Y^{2} Z^{4} + 3 X^{6} Y^{4} Z^{4} + 11 X^{4} Y^{6} Z^{4} + 3 X^{4} Y^{2} Z^{8} + 6 X^{6} Y^{3} Z^{3} + 487 X^{4} Y^{4} Z^{4} + X^{4} Y^{2} Z^{6} + 2 X^{2} Y^{6} Z^{4} + 6 X^{4} Y^{4} Z^{3} + 96 X^{4} Y^{3} Z^{4} + 22 X^{6} Y^{2} Z^{2} + 16 X^{4} Y^{4} Z^{2} + 18 X^{4} Y^{3} Z^{3} + 11 X^{4} Y^{2} Z^{4} + 42 X^{3} Y^{3} Z^{4} + 7 X^{2} Y^{6} Z^{2} + 3 X^{2} Y^{4} Z^{4} + 9 X^{2} Y^{2} Z^{6} + 6 X^{6} Y^{2} Z + 12 X^{4} Y^{2} Z^{3} + 6 X^{3} Y^{3} Z^{3} + 145 X^{4} Y^{2} Z^{2} + 201 X^{2} Y^{4} Z^{2} + 199 X^{2} Y^{2} Z^{4} + 6 X^{4} Y^{2} Z + 24 X^{4} Y Z^{2} + 18 X^{3} Y^{2} Z^{2} + 66 X^{2} Y^{3} Z^{2} + 18 X^{2} Y Z^{4} + 1979 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 12 X Y^{3} Z^{2} + 96 X^{3} Y Z + 24 X^{2} Y^{2} Z + 66 X^{2} Y Z^{2} + 42 X Y^{3} Z + 18 X Y^{2} Z^{2} + 54 X Y Z^{3} + 474 X^{2} Y Z + 702 X Y^{2} Z + 618 X Y Z^{2} + 822 X Y Z

Algorithm definition

The algorithm ⟨20×22×26:6468⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨10×11×13:924⟩.

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