Description of fast matrix multiplication algorithm: ⟨14×16×22:2961⟩

Algorithm type

X^{10} Y^{12} Z^{14} + X^{12} Y^{10} Z^{12} + X^{8} Y^{12} Z^{8} + 10 X^{8} Y^{8} Z^{8} + 4 X^{8} Y^{8} Z^{6} + 2 X^{8} Y^{6} Z^{8} + X^{4} Y^{4} Z^{14} + 4 X^{6} Y^{6} Z^{8} + 6 X^{5} Y^{6} Z^{7} + 3 X^{4} Y^{12} Z^{2} + 6 X^{6} Y^{5} Z^{6} + 2 X^{4} Y^{8} Z^{4} + 12 X^{6} Y^{4} Z^{4} + X^{4} Y^{8} Z^{2} + 7 X^{4} Y^{6} Z^{4} + 2 X^{4} Y^{4} Z^{6} + 2 X^{2} Y^{4} Z^{8} + 4 X^{6} Y^{4} Z^{2} + 183 X^{4} Y^{4} Z^{4} + 4 X^{4} Y^{2} Z^{6} + 2 X^{2} Y^{4} Z^{6} + X^{2} Y^{2} Z^{8} + 24 X^{4} Y^{4} Z^{3} + 12 X^{4} Y^{3} Z^{4} + 6 X^{2} Y^{2} Z^{7} + 19 X^{6} Y^{2} Z^{2} + 4 X^{4} Y^{4} Z^{2} + 12 X^{4} Y^{2} Z^{4} + 24 X^{3} Y^{3} Z^{4} + 9 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{4} Z^{4} + 4 X^{2} Y^{2} Z^{6} + 18 X^{2} Y^{6} Z + 23 X^{4} Y^{2} Z^{2} + 63 X^{2} Y^{4} Z^{2} + 42 X^{2} Y^{2} Z^{4} + 72 X^{3} Y^{2} Z^{2} + 6 X^{2} Y^{4} Z + 6 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 12 X Y^{2} Z^{4} + 24 X^{3} Y^{2} Z + 806 X^{2} Y^{2} Z^{2} + 24 X^{2} Y Z^{3} + 12 X Y^{2} Z^{3} + 6 X Y Z^{4} + 114 X^{3} Y Z + 24 X^{2} Y^{2} Z + 72 X^{2} Y Z^{2} + 54 X Y^{3} Z + 60 X Y^{2} Z^{2} + 24 X Y Z^{3} + 138 X^{2} Y Z + 306 X Y^{2} Z + 252 X Y Z^{2} + 408 X Y Z

Algorithm definition

The algorithm ⟨14×16×22:2961⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨7×8×11:423⟩.

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