Description of fast matrix multiplication algorithm: ⟨4×24×30:1791⟩

Algorithm type

24 X^{4} Y^{16} Z^{4} + 8 X^{2} Y^{20} Z^{2} + 2 X^{4} Y^{16} Z^{2} + 8 X Y^{20} Z + 3 X^{3} Y^{16} Z^{2} + 80 X^{2} Y^{16} Z^{2} + 10 X^{2} Y^{16} Z + X^{4} Y^{12} Z^{2} + 59 X Y^{16} Z + 104 X^{4} Y^{8} Z^{4} + 3 X^{2} Y^{13} Z + 72 X^{2} Y^{12} Z^{2} + 2 X^{4} Y^{9} Z^{2} + 4 X^{2} Y^{12} Z + X Y^{13} Z + 3 X^{4} Y^{8} Z^{2} + 2 X^{3} Y^{9} Z^{2} + 72 X Y^{12} Z + 2 X^{3} Y^{8} Z^{2} + X^{2} Y^{9} Z^{2} + 5 X^{2} Y^{9} Z + 137 X^{2} Y^{8} Z^{2} + 3 X^{2} Y^{8} Z + 32 X Y^{8} Z + 6 X^{2} Y^{5} Z + 184 X^{2} Y^{4} Z^{2} + 7 X^{2} Y^{4} Z + 16 X Y^{5} Z + 208 X^{2} Y^{2} Z^{2} + 252 X Y^{4} Z + 144 X Y^{3} Z + 64 X Y^{2} Z + 272 X Y Z

Algorithm definition

The algorithm ⟨4×24×30:1791⟩ is serendipitous tensor product (⟨2×6×6:56⟩ - 2) ⊗ ⟨2×4×5:32⟩ +⟨2×8×5:63⟩.

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