Description of fast matrix multiplication algorithm: ⟨9×29×32:4860⟩

Algorithm type

13 X^{6} Y^{2} Z^{6} + 48 X^{4} Y^{6} Z^{4} + 5 X^{5} Y^{2} Z^{6} + X^{4} Y^{5} Z^{4} + X^{3} Y^{6} Z^{4} + 420 X^{4} Y^{4} Z^{4} + 4 X^{3} Y^{5} Z^{4} + 13 X^{2} Y^{4} Z^{6} + 11 X^{4} Y^{3} Z^{4} + 11 X^{3} Y^{4} Z^{4} + 5 X^{2} Y^{3} Z^{6} + 13 X^{6} Y^{2} Z^{2} + 14 X^{6} Y Z^{3} + 44 X^{3} Y^{3} Z^{4} + 129 X^{2} Y^{6} Z^{2} + 114 X^{2} Y^{4} Z^{4} + 160 X^{2} Y^{2} Z^{6} + 5 X^{5} Y^{2} Z^{2} + 4 X^{5} Y Z^{3} + 49 X^{4} Y^{3} Z^{2} + 13 X^{2} Y^{5} Z^{2} + 2 X^{2} Y^{3} Z^{4} + 20 X^{2} Y Z^{6} + X Y^{6} Z^{2} + 2 X Y^{4} Z^{4} + 14 X^{6} Y Z + 445 X^{4} Y^{2} Z^{2} + 3 X^{3} Y^{3} Z^{2} + 16 X^{3} Y^{2} Z^{3} + 701 X^{2} Y^{4} Z^{2} + 252 X^{2} Y^{2} Z^{4} + 82 X Y^{6} Z + X Y^{5} Z^{2} + 14 X Y^{4} Z^{3} + 8 X Y^{3} Z^{4} + 4 X^{5} Y Z + 11 X^{4} Y Z^{2} + 39 X^{3} Y^{2} Z^{2} + 36 X^{2} Y^{3} Z^{2} + 18 X^{2} Y^{2} Z^{3} + 8 X Y^{5} Z + 130 X Y^{4} Z^{2} + 4 X Y^{3} Z^{3} + 14 X^{4} Y Z + 16 X^{3} Y^{2} Z + 11 X^{3} Y Z^{2} + 86 X^{2} Y^{3} Z + 178 X^{2} Y^{2} Z^{2} + 174 X^{2} Y Z^{3} + 273 X Y^{4} Z + 29 X Y^{3} Z^{2} + 164 X Y^{2} Z^{3} + 4 X^{3} Y Z + 295 X^{2} Y^{2} Z + 259 X^{2} Y Z^{2} + 9 X Y^{3} Z + 263 X Y^{2} Z^{2} + 16 X Y Z^{3} + 69 X^{2} Y Z + 77 X Y^{2} Z + 2 X Y Z^{2} + 11 X Y Z

Algorithm definition

The algorithm ⟨9×29×32:4860⟩ is the projection [[0, 30], [0]] of ⟨9×30×32:4860⟩.

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