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

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} + X^{3} Y^{3} Z^{2} + 40 X^{2} Y^{4} Z^{2} + 180 X^{2} Y^{2} Z^{4} + 42 X Y Z^{6} + X^{3} Y^{2} Z^{2} + 16 X^{2} Y^{3} Z^{2} + X Y^{5} Z + 12 X Y^{4} Z^{2} + X Y^{3} Z^{3} + 36 X Y^{2} Z^{4} + 12 X^{3} Y Z^{2} + 2 X^{2} Y^{3} Z + 153 X^{2} Y^{2} Z^{2} + 13 X Y^{4} Z + 24 X Y^{3} Z^{2} + 72 X Y Z^{4} + 14 X^{3} Y Z + 7 X^{2} Y^{2} Z + 12 X^{2} Y Z^{2} + 27 X Y^{3} Z + 114 X Y^{2} Z^{2} + 42 X Y Z^{3} + 14 X^{2} Y Z + 80 X Y^{2} Z + 90 X Y Z^{2} + 19 X Y Z

Algorithm definition

The algorithm ⟨9×10×21:1184⟩ is serendipitous tensor product (⟨3×5×7:79⟩ - 2) ⊗ ⟨3×2×3:15⟩ +⟨3×4×3:29⟩.

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