Description of fast matrix multiplication algorithm: ⟨10×18×21:2250⟩

Algorithm type

3 X^{6} Y^{4} Z^{4} + 177 X^{4} Y^{4} Z^{4} + 6 X^{6} Y^{2} Z^{2} + 6 X^{4} Y^{4} Z^{2} + 3 X^{4} Y^{2} Z^{4} + 6 X^{3} Y^{4} Z^{2} + 48 X^{4} Y^{2} Z^{2} + 435 X^{2} Y^{4} Z^{2} + 60 X^{2} Y^{2} Z^{4} + 6 X^{3} Y^{2} Z^{2} + 12 X^{2} Y^{4} Z + 12 X^{3} Y^{2} Z + 426 X^{2} Y^{2} Z^{2} + 162 X Y^{4} Z + 12 X^{3} Y Z + 108 X^{2} Y^{2} Z + 6 X^{2} Y Z^{2} + 120 X Y^{2} Z^{2} + 96 X^{2} Y Z + 294 X Y^{2} Z + 120 X Y Z^{2} + 132 X Y Z

Algorithm definition

The algorithm ⟨10×18×21:2250⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨5×6×7:150⟩.

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