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

Algorithm type

X^{14} Y^{16} Z^{14} + 9 X^{8} Y^{8} Z^{8} + 2 X^{8} Y^{8} Z^{6} + 6 X^{7} Y^{8} Z^{7} + 2 X^{6} Y^{8} Z^{8} + 2 X^{6} Y^{8} Z^{6} + 149 X^{4} Y^{4} Z^{4} + 12 X^{4} Y^{4} Z^{3} + 12 X^{3} Y^{4} Z^{4} + 9 X^{6} Y^{2} Z^{2} + 9 X^{4} Y^{4} Z^{2} + 12 X^{3} Y^{4} Z^{3} + 6 X^{2} Y^{6} Z^{2} + 9 X^{2} Y^{4} Z^{4} + 9 X^{2} Y^{2} Z^{6} + 3 X^{4} Y^{2} Z^{2} + 34 X^{2} Y^{4} Z^{2} + 3 X^{2} Y^{2} Z^{4} + 687 X^{2} Y^{2} Z^{2} + 54 X^{3} Y Z + 54 X^{2} Y^{2} Z + 36 X Y^{3} Z + 54 X Y^{2} Z^{2} + 54 X Y Z^{3} + 18 X^{2} Y Z + 204 X Y^{2} Z + 18 X Y Z^{2} + 702 X Y Z

Algorithm definition

The algorithm ⟨14×16×16:2170⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨7×8×8:310⟩.

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