Description of fast matrix multiplication algorithm: ⟨16×20×26:4802⟩

Algorithm type

26X8Y8Z8+9X8Y8Z6+X8Y6Z6+2X4Y8Z6+6X8Y4Z4+19X4Y8Z4+13X4Y4Z8+2X8Y4Z2+3X4Y4Z6+X4Y6Z2+375X4Y4Z4+54X4Y4Z3+3X6Y2Z2+7X4Y4Z2+6X4Y3Z3+6X4Y2Z4+3X2Y6Z2+9X2Y4Z4+12X2Y4Z3+81X4Y2Z2+222X2Y4Z2+168X2Y2Z4+12X4Y2Z+18X2Y2Z3+6X2Y3Z+1428X2Y2Z2+18X3YZ+42X2Y2Z+36X2YZ2+18XY3Z+54XY2Z2+270X2YZ+648XY2Z+540XYZ2+684XYZ26X8Y8Z89X8Y8Z6X8Y6Z62X4Y8Z66X8Y4Z419X4Y8Z413X4Y4Z82X8Y4Z23X4Y4Z6X4Y6Z2375X4Y4Z454X4Y4Z33X6Y2Z27X4Y4Z26X4Y3Z36X4Y2Z43X2Y6Z29X2Y4Z412X2Y4Z381X4Y2Z2222X2Y4Z2168X2Y2Z412X4Y2Z18X2Y2Z36X2Y3Z1428X2Y2Z218X3YZ42X2Y2Z36X2YZ218XY3Z54XY2Z2270X2YZ648XY2Z540XYZ2684XYZ26*X^8*Y^8*Z^8+9*X^8*Y^8*Z^6+X^8*Y^6*Z^6+2*X^4*Y^8*Z^6+6*X^8*Y^4*Z^4+19*X^4*Y^8*Z^4+13*X^4*Y^4*Z^8+2*X^8*Y^4*Z^2+3*X^4*Y^4*Z^6+X^4*Y^6*Z^2+375*X^4*Y^4*Z^4+54*X^4*Y^4*Z^3+3*X^6*Y^2*Z^2+7*X^4*Y^4*Z^2+6*X^4*Y^3*Z^3+6*X^4*Y^2*Z^4+3*X^2*Y^6*Z^2+9*X^2*Y^4*Z^4+12*X^2*Y^4*Z^3+81*X^4*Y^2*Z^2+222*X^2*Y^4*Z^2+168*X^2*Y^2*Z^4+12*X^4*Y^2*Z+18*X^2*Y^2*Z^3+6*X^2*Y^3*Z+1428*X^2*Y^2*Z^2+18*X^3*Y*Z+42*X^2*Y^2*Z+36*X^2*Y*Z^2+18*X*Y^3*Z+54*X*Y^2*Z^2+270*X^2*Y*Z+648*X*Y^2*Z+540*X*Y*Z^2+684*X*Y*Z

Algorithm definition

The algorithm ⟨16×20×26:4802⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×10×13:686⟩.

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