Description of fast matrix multiplication algorithm: ⟨20×28×30:8965⟩

Algorithm type

90 X^{6} Y^{4} Z^{4} + 90 X^{8} Y^{2} Z^{2} + 1080 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{4} Z^{5} + 180 X^{6} Y^{2} Z^{2} + 270 X^{4} Y^{4} Z^{2} + 315 X^{2} Y^{6} Z^{2} + 115 X^{2} Y^{4} Z^{4} + 4 X^{2} Y^{3} Z^{5} + 90 X^{2} Y^{2} Z^{6} + 40 X^{3} Y^{4} Z^{2} + 40 X^{3} Y^{2} Z^{4} + 200 X^{2} Y^{4} Z^{3} + 128 X^{2} Y^{3} Z^{4} + 4 X^{2} Y^{2} Z^{5} + 630 X^{4} Y^{2} Z^{2} + 1062 X^{2} Y^{4} Z^{2} + 167 X^{2} Y^{3} Z^{3} + 648 X^{2} Y^{2} Z^{4} + 140 X Y^{6} Z + 20 X Y^{3} Z^{4} + 14 X Y^{2} Z^{5} + 40 X Y Z^{6} + 40 X^{4} Y^{2} Z + 40 X^{4} Y Z^{2} + 120 X^{2} Y^{4} Z + 20 X^{2} Y^{3} Z^{2} + 116 X^{2} Y^{2} Z^{3} + 131 X Y^{4} Z^{2} + 112 X Y^{2} Z^{4} + 80 X^{3} Y^{2} Z + 80 X^{3} Y Z^{2} + 481 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 292 X Y^{4} Z + 272 X Y^{3} Z^{2} + 141 X Y^{2} Z^{3} + 71 X Y Z^{4} + 365 X^{2} Y^{2} Z + 339 X^{2} Y Z^{2} + 9 X Y^{3} Z + 523 X Y^{2} Z^{2} + 9 X Y Z^{3} + 8 X^{2} Y Z + 156 X Y^{2} Z + 179 X Y Z^{2} + 6 X Y Z

Algorithm definition

The algorithm ⟨20×28×30:8965⟩ is serendipitous tensor product (⟨4×4×10:115⟩ - 30) ⊗ ⟨5×7×3:79⟩ +15⟨5×7×6: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