Description of fast matrix multiplication algorithm: ⟨4×10×22:616⟩

Algorithm type

X4Y8Z4+5X4Y6Z4+X2Y10Z2+16X4Y4Z4+6X2Y8Z2+12X2Y6Z2+24X2Y4Z2+30X2Y3Z2+6XY5Z+125X2Y2Z2+36XY4Z+72XY3Z+108XY2Z+174XYZX4Y8Z45X4Y6Z4X2Y10Z216X4Y4Z46X2Y8Z212X2Y6Z224X2Y4Z230X2Y3Z26XY5Z125X2Y2Z236XY4Z72XY3Z108XY2Z174XYZX^4*Y^8*Z^4+5*X^4*Y^6*Z^4+X^2*Y^10*Z^2+16*X^4*Y^4*Z^4+6*X^2*Y^8*Z^2+12*X^2*Y^6*Z^2+24*X^2*Y^4*Z^2+30*X^2*Y^3*Z^2+6*X*Y^5*Z+125*X^2*Y^2*Z^2+36*X*Y^4*Z+72*X*Y^3*Z+108*X*Y^2*Z+174*X*Y*Z

Algorithm definition

The algorithm ⟨4×10×22:616⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨2×5×11:88⟩.

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