Description of fast matrix multiplication algorithm: ⟨4×25×30:1879⟩

Algorithm type

8 X^{2} Y^{16} Z^{2} + 2 X^{2} Y^{14} Z^{2} + 8 X Y^{16} Z + X Y^{14} Z^{2} + 20 X^{4} Y^{8} Z^{4} + 8 X^{2} Y^{12} Z^{2} + 3 X Y^{14} Z + 2 X Y^{13} Z + 2 X Y^{12} Z^{2} + 8 X Y^{12} Z + 4 X^{2} Y^{8} Z^{3} + 2 X Y^{11} Z + 2 X Y^{10} Z^{2} + 110 X^{4} Y^{4} Z^{4} + 44 X^{2} Y^{8} Z^{2} + 2 X^{2} Y^{7} Z^{2} + 32 X Y^{9} Z + 125 X^{2} Y^{6} Z^{2} + 24 X Y^{8} Z + 182 X^{2} Y^{4} Z^{2} + 96 X Y^{6} Z + 2 X Y^{5} Z + 4 X Y^{4} Z^{2} + 356 X^{2} Y^{2} Z^{2} + 98 X Y^{4} Z + X Y^{3} Z^{2} + 201 X Y^{3} Z + 244 X Y^{2} Z + 288 X Y Z

Algorithm definition

The algorithm ⟨4×25×30:1879⟩ is serendipitous tensor product (⟨2×5×6:47⟩ - 2) ⊗ ⟨2×5×5:40⟩ +⟨2×5×10:79⟩.

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