Description of fast matrix multiplication algorithm: ⟨9×16×18:1560⟩

Algorithm type

132 X^{4} Y^{4} Z^{4} + 36 X^{6} Y^{2} Z^{2} + 36 X^{4} Y^{4} Z^{2} + 36 X^{2} Y^{6} Z^{2} + 18 X^{2} Y^{2} Z^{6} + 84 X^{4} Y^{2} Z^{2} + 198 X^{2} Y^{4} Z^{2} + 150 X^{2} Y^{2} Z^{4} + 36 X Y^{6} Z + 18 X Y Z^{6} + 36 X^{2} Y^{4} Z + 36 X^{3} Y^{2} Z + 36 X^{3} Y Z^{2} + 114 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 36 X Y^{3} Z^{2} + 18 X Y^{2} Z^{3} + 24 X Y Z^{4} + 72 X^{2} Y^{2} Z + 96 X^{2} Y Z^{2} + 72 X Y^{2} Z^{2} + 24 X^{2} Y Z + 54 X Y^{2} Z + 102 X Y Z^{2} + 24 X Y Z

Algorithm definition

The algorithm ⟨9×16×18:1560⟩ is serendipitous tensor product (⟨3×4×3:29⟩ - 4) ⊗ ⟨3×4×6:54⟩ +2⟨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