Description of fast matrix multiplication algorithm: ⟨2×13×14:280⟩

Algorithm type

X Y^{11} Z + 3 X^{2} Y^{8} Z^{2} + 9 X Y^{10} Z + 9 X^{2} Y^{7} Z^{2} + 8 X Y^{9} Z + 7 X^{2} Y^{6} Z^{2} + 4 X Y^{8} Z + 8 X^{2} Y^{5} Z^{2} + 12 X Y^{7} Z + 6 X^{2} Y^{4} Z^{2} + 9 X Y^{6} Z + 18 X^{2} Y^{3} Z^{2} + 9 X Y^{5} Z + 33 X^{2} Y^{2} Z^{2} + 11 X Y^{4} Z + 9 X Y^{3} Z + 21 X Y^{2} Z + 103 X Y Z

Algorithm definition

The algorithm ⟨2×13×14:280⟩ is taken from:

John Edward Hopcroft and Leslie R. Kerr. On minimizing the number of multiplication necessary for matrix multiplication. SIAM Journal on Applied Mathematics, 20(1), January 1971. [DOI]

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