Description of fast matrix multiplication algorithm: ⟨10×24×28:3880⟩

Algorithm type

6 X^{6} Y^{4} Z^{4} + 8 X^{6} Y^{2} Z^{4} + 354 X^{4} Y^{4} Z^{4} + 2 X^{3} Y^{6} Z^{2} + 16 X^{6} Y^{2} Z^{2} + 12 X^{4} Y^{4} Z^{2} + 14 X^{4} Y^{2} Z^{4} + 118 X^{2} Y^{6} Z^{2} + 4 X^{5} Y^{2} Z^{2} + 8 X^{3} Y^{4} Z^{2} + 4 X^{2} Y^{6} Z + 78 X^{4} Y^{2} Z^{2} + 8 X^{3} Y^{2} Z^{3} + 634 X^{2} Y^{4} Z^{2} + 116 X^{2} Y^{2} Z^{4} + 54 X Y^{6} Z + 2 X^{3} Y^{3} Z + 30 X^{3} Y^{2} Z^{2} + 16 X^{2} Y^{4} Z + 2 X^{2} Y^{3} Z^{2} + 8 X^{3} Y^{2} Z + 16 X^{3} Y Z^{2} + 24 X^{2} Y^{3} Z + 720 X^{2} Y^{2} Z^{2} + 216 X Y^{4} Z + 38 X Y^{3} Z^{2} + 82 X^{3} Y Z + 116 X^{2} Y^{2} Z + 36 X^{2} Y Z^{2} + 36 X Y^{3} Z + 152 X Y^{2} Z^{2} + 150 X^{2} Y Z + 414 X Y^{2} Z + 196 X Y Z^{2} + 190 X Y Z

Algorithm definition

The algorithm ⟨10×24×28:3880⟩ is serendipitous tensor product (⟨5×6×7:150⟩ - 10) ⊗ ⟨2×4×4:26⟩ +5⟨4×4×4:48⟩.

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