Description of fast matrix multiplication algorithm: ⟨14×15×15:1905⟩

Algorithm type

3 X^{4} Y^{6} Z^{4} + 141 X^{4} Y^{4} Z^{4} + 15 X^{2} Y^{6} Z^{2} + 3 X^{2} Y^{4} Z^{4} + 3 X^{2} Y^{2} Z^{6} + 60 X^{4} Y^{2} Z^{2} + 309 X^{2} Y^{4} Z^{2} + 57 X^{2} Y^{2} Z^{4} + 18 X Y^{6} Z + 6 X^{2} Y^{3} Z^{2} + 6 X Y^{4} Z^{2} + 360 X^{2} Y^{2} Z^{2} + 54 X Y^{4} Z + 6 X Y^{2} Z^{3} + 120 X^{2} Y^{2} Z + 18 X Y^{3} Z + 120 X Y^{2} Z^{2} + 6 X Y Z^{3} + 120 X^{2} Y Z + 210 X Y^{2} Z + 114 X Y Z^{2} + 156 X Y Z

Algorithm definition

The algorithm ⟨14×15×15:1905⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨7×5×5:127⟩.

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