Description of fast matrix multiplication algorithm: ⟨6×30×32:3400⟩

Algorithm type

18 X^{4} Y^{10} Z^{4} + 72 X^{4} Y^{8} Z^{4} + 18 X^{4} Y^{6} Z^{4} + 144 X^{2} Y^{10} Z^{2} + 32 X^{2} Y^{8} Z^{3} + 198 X^{4} Y^{4} Z^{4} + 180 X^{2} Y^{8} Z^{2} + 126 X Y^{10} Z + 48 X Y^{8} Z^{3} + 18 X^{4} Y^{5} Z^{2} + 72 X^{4} Y^{4} Z^{2} + 162 X^{2} Y^{6} Z^{2} + 32 X^{2} Y^{5} Z^{3} + 108 X Y^{8} Z + 18 X^{4} Y^{3} Z^{2} + 48 X Y^{5} Z^{3} + 198 X^{4} Y^{2} Z^{2} + 126 X^{2} Y^{5} Z + 306 X^{2} Y^{4} Z^{2} + 144 X Y^{6} Z + 108 X^{2} Y^{4} Z + 144 X^{2} Y^{3} Z + 288 X^{2} Y^{2} Z^{2} + 108 X Y^{4} Z + 108 X^{2} Y^{2} Z + 288 X^{2} Y Z + 288 X Y^{2} Z

Algorithm definition

The algorithm ⟨6×30×32:3400⟩ is serendipitous tensor product (⟨2×5×8:63⟩ - 19) ⊗ ⟨3×6×4:54⟩ +⟨3×6×12:160⟩ +8⟨3×6×8:108⟩.

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