Description of fast matrix multiplication algorithm: ⟨4×10×20:560⟩

Algorithm type

20X4Y4Z4+8X2Y6Z2+20X2Y4Z2+152X2Y2Z2+48XY3Z+120XY2Z+192XYZ20X4Y4Z48X2Y6Z220X2Y4Z2152X2Y2Z248XY3Z120XY2Z192XYZ20*X^4*Y^4*Z^4+8*X^2*Y^6*Z^2+20*X^2*Y^4*Z^2+152*X^2*Y^2*Z^2+48*X*Y^3*Z+120*X*Y^2*Z+192*X*Y*Z

Algorithm definition

The algorithm ⟨4×10×20:560⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×10×10:280⟩.

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