Description of fast matrix multiplication algorithm: ⟨4×18×20:939⟩

Algorithm type

X^{2} Y^{14} Z^{2} + 2 X Y^{15} Z + 8 X^{4} Y^{8} Z^{4} + 10 X^{2} Y^{12} Z^{2} + 2 X Y^{14} Z + X^{2} Y^{12} Z + 2 X^{2} Y^{10} Z^{2} + 13 X Y^{12} Z + X^{3} Y^{8} Z^{2} + 44 X^{4} Y^{4} Z^{4} + 11 X^{2} Y^{8} Z^{2} + 2 X Y^{10} Z + 2 X^{2} Y^{8} Z + 32 X Y^{9} Z + 76 X^{2} Y^{6} Z^{2} + 4 X Y^{8} Z + 40 X^{2} Y^{4} Z^{2} + 16 X Y^{6} Z + 5 X^{2} Y^{4} Z + 204 X^{2} Y^{2} Z^{2} + 31 X Y^{4} Z + 168 X Y^{3} Z + 48 X Y^{2} Z + 216 X Y Z

Algorithm definition

The algorithm ⟨4×18×20:939⟩ is serendipitous tensor product (⟨2×6×5:47⟩ - 2) ⊗ ⟨2×3×4:20⟩ +⟨2×6×4:39⟩.

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