Description of fast matrix multiplication algorithm: ⟨14×20×30:4782⟩

Algorithm type

8 X^{4} Y^{12} Z^{4} + 472 X^{4} Y^{8} Z^{4} + 24 X^{2} Y^{12} Z^{2} + 8 X^{4} Y^{8} Z^{2} + 16 X^{2} Y^{8} Z^{4} + 16 X Y^{12} Z + 600 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{8} Z + 16 X Y^{8} Z^{2} + 128 X^{4} Y^{4} Z^{2} + 192 X^{2} Y^{4} Z^{4} + 128 X Y^{8} Z + 6 X^{4} Y^{2} Z^{3} + 6 X^{3} Y^{2} Z^{4} + 14 X^{4} Y^{2} Z^{2} + 7 X^{3} Y^{2} Z^{3} + X^{3} Y Z^{4} + 136 X^{2} Y^{4} Z^{2} + 9 X^{2} Y^{2} Z^{4} + 4 X^{4} Y^{2} Z + 15 X^{4} Y Z^{2} + 22 X^{3} Y^{2} Z^{2} + X^{3} Y Z^{3} + 128 X^{2} Y^{4} Z + 16 X^{2} Y^{3} Z^{2} + 11 X^{2} Y^{2} Z^{3} + 8 X^{2} Y Z^{4} + 192 X Y^{4} Z^{2} + 14 X Y^{2} Z^{4} + 17 X^{4} Y Z + 5 X^{3} Y^{2} Z + 18 X^{3} Y Z^{2} + 4 X^{2} Y^{3} Z + 982 X^{2} Y^{2} Z^{2} + 11 X^{2} Y Z^{3} + 136 X Y^{4} Z + 3 X Y^{3} Z^{2} + 6 X Y^{2} Z^{3} + 36 X^{3} Y Z + 22 X^{2} Y^{2} Z + 28 X^{2} Y Z^{2} + 37 X Y^{3} Z + 40 X Y^{2} Z^{2} + 281 X^{2} Y Z + 256 X Y^{2} Z + 399 X Y Z^{2} + 295 X Y Z

Algorithm definition

The algorithm ⟨14×20×30:4782⟩ is serendipitous tensor product (⟨7×5×6:150⟩ - 12) ⊗ ⟨2×4×5:32⟩ +6⟨4×4×5:61⟩.

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