Description of fast matrix multiplication algorithm: ⟨9×28×30:4264⟩

Algorithm type

36 X^{4} Y^{6} Z^{4} + 48 X^{6} Y^{3} Z^{3} + 432 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{8} Z^{2} + 80 X^{6} Y^{2} Z^{2} + 108 X^{4} Y^{4} Z^{2} + 16 X^{4} Y^{3} Z^{3} + 108 X^{2} Y^{6} Z^{2} + 36 X^{2} Y^{2} Z^{6} + 36 X Y^{8} Z + 88 X^{3} Y^{3} Z^{3} + 36 X^{2} Y^{3} Z^{4} + 226 X^{4} Y^{2} Z^{2} + 684 X^{2} Y^{4} Z^{2} + 468 X^{2} Y^{2} Z^{4} + 72 X Y^{6} Z + 36 X Y Z^{6} + 108 X^{2} Y^{4} Z + 36 X Y^{4} Z^{2} + 8 X Y^{3} Z^{3} + 86 X^{3} Y^{2} Z + 86 X^{3} Y Z^{2} + 162 X^{2} Y^{2} Z^{2} + 252 X Y^{4} Z + 72 X Y^{3} Z^{2} + 36 X Y^{2} Z^{3} + 36 X Y Z^{4} + 216 X^{2} Y^{2} Z + 216 X^{2} Y Z^{2} + 288 X Y^{2} Z^{2} + 58 X Y^{2} Z + 58 X Y Z^{2}

Algorithm definition

The algorithm ⟨9×28×30:4264⟩ is serendipitous tensor product (⟨3×7×5:79⟩ - 5) ⊗ ⟨3×4×6:54⟩ +⟨3×20×6:268⟩.

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