Description of fast matrix multiplication algorithm: ⟨8×21×29:2970⟩

Algorithm type

24 X^{4} Y^{10} Z^{4} + 2 X^{4} Y^{10} Z^{3} + 2 X^{4} Y^{9} Z^{4} + 8 X^{4} Y^{9} Z^{3} + 31 X^{4} Y^{8} Z^{4} + 5 X^{4} Y^{8} Z^{3} + 13 X^{4} Y^{6} Z^{4} + 101 X^{2} Y^{10} Z^{2} + 5 X^{4} Y^{5} Z^{4} + 5 X^{2} Y^{10} Z + 24 X^{2} Y^{9} Z^{2} + 170 X^{4} Y^{4} Z^{4} + 14 X^{2} Y^{9} Z + 155 X^{2} Y^{8} Z^{2} + 81 X Y^{10} Z + 5 X^{4} Y^{4} Z^{3} + 5 X^{4} Y^{3} Z^{4} + 2 X^{2} Y^{8} Z + 5 X^{2} Y^{7} Z^{2} + 26 X^{2} Y^{5} Z^{4} + 21 X Y^{9} Z + 18 X^{4} Y^{2} Z^{4} + 86 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{5} Z^{3} + 34 X^{2} Y^{4} Z^{4} + 122 X Y^{8} Z + 4 X^{2} Y^{5} Z^{2} + 6 X^{2} Y^{4} Z^{3} + 16 X^{2} Y^{3} Z^{4} + 4 X Y^{7} Z + 26 X^{4} Y^{2} Z^{2} + 267 X^{2} Y^{4} Z^{2} + 176 X^{2} Y^{2} Z^{4} + 72 X Y^{6} Z + 87 X Y^{5} Z^{2} + 5 X^{4} Y^{2} Z + 5 X^{4} Y Z^{2} + 2 X^{2} Y^{4} Z + 19 X^{2} Y^{3} Z^{2} + 4 X^{2} Y^{2} Z^{3} + 20 X^{2} Y Z^{4} + 9 X Y^{5} Z + 133 X Y^{4} Z^{2} + 270 X^{2} Y^{2} Z^{2} + 99 X Y^{4} Z + 74 X Y^{3} Z^{2} + 30 X^{2} Y^{2} Z + 30 X^{2} Y Z^{2} + 12 X Y^{3} Z + 102 X Y^{2} Z^{2} + 8 X^{2} Y Z + 252 X Y^{2} Z + 258 X Y Z^{2}

Algorithm definition

The algorithm ⟨8×21×29:2970⟩ is the projection [[0, 0], [30]] of ⟨8×21×30:2970⟩.

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