Description of fast matrix multiplication algorithm: ⟨14×24×28:5418⟩

Algorithm type

24 X^{8} Y^{8} Z^{8} + 2 X^{8} Y^{8} Z^{6} + 9 X^{6} Y^{8} Z^{8} + X^{12} Y^{4} Z^{4} + 10 X^{6} Y^{8} Z^{6} + X^{4} Y^{12} Z^{4} + 2 X^{4} Y^{8} Z^{8} + 2 X^{8} Y^{4} Z^{6} + X^{4} Y^{8} Z^{6} + 7 X^{8} Y^{4} Z^{4} + 48 X^{6} Y^{6} Z^{4} + 22 X^{4} Y^{8} Z^{4} + 9 X^{4} Y^{4} Z^{8} + 72 X^{6} Y^{6} Z^{2} + 3 X^{6} Y^{4} Z^{4} + 3 X^{4} Y^{4} Z^{6} + 5 X^{2} Y^{8} Z^{4} + 347 X^{4} Y^{4} Z^{4} + 12 X^{4} Y^{4} Z^{3} + 54 X^{3} Y^{4} Z^{4} + 9 X^{6} Y^{2} Z^{2} + 2 X^{4} Y^{4} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 60 X^{3} Y^{4} Z^{3} + 9 X^{2} Y^{6} Z^{2} + 27 X^{2} Y^{4} Z^{4} + 12 X^{4} Y^{2} Z^{3} + 6 X^{2} Y^{4} Z^{3} + 126 X^{4} Y^{2} Z^{2} + 288 X^{3} Y^{3} Z^{2} + 267 X^{2} Y^{4} Z^{2} + 90 X^{2} Y^{2} Z^{4} + 432 X^{3} Y^{3} Z + 18 X^{3} Y^{2} Z^{2} + 18 X^{2} Y^{2} Z^{3} + 30 X Y^{4} Z^{2} + 1284 X^{2} Y^{2} Z^{2} + 18 X^{3} Y Z + 12 X^{2} Y^{2} Z + 36 X^{2} Y Z^{2} + 18 X Y^{3} Z + 90 X Y^{2} Z^{2} + 504 X^{2} Y Z + 810 X Y^{2} Z + 216 X Y Z^{2} + 396 X Y Z

Algorithm definition

The algorithm ⟨14×24×28:5418⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨7×12×14:774⟩.

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