Description of fast matrix multiplication algorithm: ⟨4×18×30:1397⟩

Algorithm type

X^{4} Y^{12} Z^{2} + X^{3} Y^{12} Z^{2} + 2 X Y^{15} Z + 15 X^{4} Y^{8} Z^{4} + 6 X^{2} Y^{12} Z^{2} + 8 X^{2} Y^{12} Z + 4 X^{4} Y^{8} Z^{2} + 5 X^{2} Y^{10} Z^{2} + 17 X Y^{12} Z + 4 X^{3} Y^{8} Z^{2} + X^{2} Y^{9} Z^{2} + 65 X^{4} Y^{4} Z^{4} + X^{2} Y^{9} Z + 55 X^{2} Y^{8} Z^{2} + 6 X Y^{10} Z + 4 X^{2} Y^{8} Z + 18 X Y^{9} Z + 71 X^{2} Y^{6} Z^{2} + 42 X Y^{8} Z + 3 X^{2} Y^{5} Z + 134 X^{2} Y^{4} Z^{2} + 62 X Y^{6} Z + 8 X^{2} Y^{4} Z + 15 X Y^{5} Z + 241 X^{2} Y^{2} Z^{2} + 112 X Y^{4} Z + 142 X Y^{3} Z + 150 X Y^{2} Z + 204 X Y Z

Algorithm definition

The algorithm ⟨4×18×30:1397⟩ is serendipitous tensor product (⟨2×6×6:56⟩ - 2) ⊗ ⟨2×3×5:25⟩ +⟨2×6×5:47⟩.

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