Description of fast matrix multiplication algorithm: ⟨2×5×8:64⟩

Algorithm type

X2Y4Z2+8X2Y3Z2+XY5Z+7X2Y2Z2+10XY4Z+11XY3Z+9XY2Z+17XYZX2Y4Z28X2Y3Z2XY5Z7X2Y2Z210XY4Z11XY3Z9XY2Z17XYZX^2*Y^4*Z^2+8*X^2*Y^3*Z^2+X*Y^5*Z+7*X^2*Y^2*Z^2+10*X*Y^4*Z+11*X*Y^3*Z+9*X*Y^2*Z+17*X*Y*Z

Algorithm definition

The algorithm ⟨2×5×8:64⟩ 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