Description of fast matrix multiplication algorithm: ⟨15×28×30:6855⟩

Algorithm type

18 X^{4} Y^{4} Z^{6} + 849 X^{4} Y^{4} Z^{4} + 18 X^{6} Y^{2} Z^{2} + 18 X^{4} Y^{2} Z^{4} + 72 X^{2} Y^{2} Z^{6} + 18 X^{2} Y^{4} Z^{3} + 348 X^{4} Y^{2} Z^{2} + 1206 X^{2} Y^{4} Z^{2} + 1020 X^{2} Y^{2} Z^{4} + 54 X Y Z^{6} + 18 X^{2} Y Z^{4} + 18 X^{3} Y^{2} Z + 18 X^{3} Y Z^{2} + 462 X^{2} Y^{2} Z^{2} + 360 X Y^{4} Z + 54 X Y^{2} Z^{3} + 174 X Y Z^{4} + 342 X^{2} Y^{2} Z + 354 X^{2} Y Z^{2} + 522 X Y^{2} Z^{2} + 12 X^{2} Y Z + 432 X Y^{2} Z + 456 X Y Z^{2} + 12 X Y Z

Algorithm definition

The algorithm ⟨15×28×30:6855⟩ is serendipitous tensor product (⟨5×7×5:127⟩ - 2) ⊗ ⟨3×4×6:54⟩ +⟨6×4×6:105⟩.

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