Description of fast matrix multiplication algorithm: ⟨8×22×24:2555⟩

Algorithm type

3 X^{8} Y^{16} Z^{8} + X^{8} Y^{16} Z^{4} + X^{4} Y^{20} Z^{4} + 11 X^{8} Y^{8} Z^{8} + 7 X^{4} Y^{16} Z^{4} + 2 X^{6} Y^{8} Z^{8} + X^{4} Y^{14} Z^{4} + 9 X^{4} Y^{12} Z^{4} + 37 X^{4} Y^{8} Z^{4} + 9 X^{4} Y^{8} Z^{2} + 9 X^{2} Y^{10} Z^{2} + 153 X^{4} Y^{4} Z^{4} + 78 X^{2} Y^{8} Z^{2} + 12 X^{3} Y^{4} Z^{4} + 6 X^{2} Y^{7} Z^{2} + 105 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{4} Z^{4} + 138 X^{2} Y^{4} Z^{2} + 18 X^{2} Y^{4} Z + 18 X Y^{5} Z + 627 X^{2} Y^{2} Z^{2} + 216 X Y^{4} Z + 306 X Y^{3} Z + 12 X Y^{2} Z^{2} + 144 X Y^{2} Z + 630 X Y Z

Algorithm definition

The algorithm ⟨8×22×24:2555⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×11×12:365⟩.

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