Description of fast matrix multiplication algorithm: ⟨9×10×21:1185⟩

Algorithm type

6 X^{4} Y^{6} Z^{4} + 72 X^{4} Y^{4} Z^{4} + 6 X^{2} Y^{8} Z^{2} + 6 X^{6} Y^{2} Z^{2} + 12 X^{2} Y^{6} Z^{2} + 18 X^{2} Y^{4} Z^{4} + 21 X^{2} Y^{2} Z^{6} + 12 X^{2} Y^{3} Z^{4} + 6 X^{4} Y^{2} Z^{2} + 42 X^{2} Y^{4} Z^{2} + 180 X^{2} Y^{2} Z^{4} + 42 X Y Z^{6} + 12 X^{2} Y^{3} Z^{2} + 12 X Y^{4} Z^{2} + 36 X Y^{2} Z^{4} + 12 X^{3} Y Z^{2} + 156 X^{2} Y^{2} Z^{2} + 12 X Y^{4} Z + 24 X Y^{3} Z^{2} + 72 X Y Z^{4} + 12 X^{3} Y Z + 12 X^{2} Y Z^{2} + 24 X Y^{3} Z + 120 X Y^{2} Z^{2} + 42 X Y Z^{3} + 12 X^{2} Y Z + 84 X Y^{2} Z + 96 X Y Z^{2} + 24 X Y Z

Algorithm definition

The algorithm ⟨9×10×21:1185⟩ is the (Kronecker) tensor product of ⟨3×2×3:15⟩ with ⟨3×5×7:79⟩.

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