Description of fast matrix multiplication algorithm: ⟨6×15×21:1200⟩

Algorithm type

6 X^{4} Y^{8} Z^{4} + 12 X^{4} Y^{6} Z^{4} + 60 X^{4} Y^{4} Z^{4} + 21 X^{2} Y^{8} Z^{2} + 3 X^{2} Y^{6} Z^{4} + 45 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{4} Z^{4} + 6 X^{2} Y^{2} Z^{6} + 18 X Y^{8} Z + 6 X Y^{6} Z^{2} + 159 X^{2} Y^{4} Z^{2} + 27 X^{2} Y^{2} Z^{4} + 42 X Y^{6} Z + 24 X^{2} Y^{3} Z^{2} + 24 X Y^{4} Z^{2} + 177 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 6 X Y^{3} Z^{2} + 12 X Y^{2} Z^{3} + 42 X Y^{3} Z + 78 X Y^{2} Z^{2} + 12 X Y Z^{3} + 168 X Y^{2} Z + 54 X Y Z^{2} + 114 X Y Z

Algorithm definition

The algorithm ⟨6×15×21:1200⟩ is the (Kronecker) tensor product of ⟨3×5×7:80⟩ with ⟨2×3×3:15⟩.

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