Description of fast matrix multiplication algorithm: ⟨18×28×30:8088⟩

Algorithm type

18 X^{4} Y^{4} Z^{6} + 1074 X^{4} Y^{4} Z^{4} + 30 X^{4} Y^{2} Z^{4} + 18 X^{2} Y^{4} Z^{4} + 54 X^{2} Y^{2} Z^{6} + 18 X^{2} Y^{4} Z^{3} + 462 X^{4} Y^{2} Z^{2} + 1422 X^{2} Y^{4} Z^{2} + 1350 X^{2} Y^{2} Z^{4} + 36 X Y Z^{6} + 60 X^{2} Y Z^{4} + 18 X Y^{4} Z^{2} + 18 X Y^{2} Z^{4} + 402 X^{2} Y^{2} Z^{2} + 360 X Y^{4} Z + 36 X Y^{2} Z^{3} + 276 X Y Z^{4} + 450 X^{2} Y^{2} Z + 534 X^{2} Y Z^{2} + 612 X Y^{2} Z^{2} + 24 X^{2} Y Z + 360 X Y^{2} Z + 420 X Y Z^{2} + 36 X Y Z

Algorithm definition

The algorithm ⟨18×28×30:8088⟩ is serendipitous tensor product (⟨6×7×5:150⟩ - 8) ⊗ ⟨3×4×6:54⟩ +4⟨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