Description of fast matrix multiplication algorithm: ⟨4×10×16:448⟩

Algorithm type

X4Y8Z4+8X4Y6Z4+X2Y10Z2+7X4Y4Z4+10X2Y8Z2+11X2Y6Z2+15X2Y4Z2+48X2Y3Z2+6XY5Z+59X2Y2Z2+60XY4Z+66XY3Z+54XY2Z+102XYZX4Y8Z48X4Y6Z4X2Y10Z27X4Y4Z410X2Y8Z211X2Y6Z215X2Y4Z248X2Y3Z26XY5Z59X2Y2Z260XY4Z66XY3Z54XY2Z102XYZX^4*Y^8*Z^4+8*X^4*Y^6*Z^4+X^2*Y^10*Z^2+7*X^4*Y^4*Z^4+10*X^2*Y^8*Z^2+11*X^2*Y^6*Z^2+15*X^2*Y^4*Z^2+48*X^2*Y^3*Z^2+6*X*Y^5*Z+59*X^2*Y^2*Z^2+60*X*Y^4*Z+66*X*Y^3*Z+54*X*Y^2*Z+102*X*Y*Z

Algorithm definition

The algorithm ⟨4×10×16:448⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨2×5×8:64⟩.

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