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

Algorithm type

12 X^{8} Y^{8} Z^{8} + 4 X^{6} Y^{6} Z^{8} + 163 X^{4} Y^{4} Z^{4} + 13 X^{6} Y^{2} Z^{2} + 4 X^{4} Y^{4} Z^{2} + 4 X^{4} Y^{2} Z^{4} + 24 X^{3} Y^{3} Z^{4} + 12 X^{2} Y^{6} Z^{2} + 14 X^{2} Y^{4} Z^{4} + 12 X^{2} Y^{2} Z^{6} + 4 X^{4} Y^{2} Z^{2} + 28 X^{2} Y^{4} Z^{2} + 28 X^{2} Y^{2} Z^{4} + 597 X^{2} Y^{2} Z^{2} + 78 X^{3} Y Z + 24 X^{2} Y^{2} Z + 24 X^{2} Y Z^{2} + 72 X Y^{3} Z + 84 X Y^{2} Z^{2} + 72 X Y Z^{3} + 24 X^{2} Y Z + 168 X Y^{2} Z + 168 X Y Z^{2} + 306 X Y Z

Algorithm definition

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

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