Description of fast matrix multiplication algorithm: ⟨12×22×26:4032⟩

Algorithm type

16X12Y10Z8+24X12Y10Z4+12X8Y8Z8+X8Y6Z8+X6Y8Z8+4X6Y6Z8+13X8Y4Z4+16X6Y6Z4+17X4Y8Z4+64X4Y6Z6+96X6Y5Z4+X8Y2Z4+24X6Y6Z2+3X6Y4Z4+13X4Y6Z4+X2Y8Z4+96X2Y6Z6+144X6Y5Z2+3X6Y2Z4+148X4Y4Z4+2X4Y2Z6+8X2Y8Z2+3X2Y6Z4+3X2Y4Z6+6X4Y3Z4+6X3Y4Z4+6X6Y2Z2+4X4Y4Z2+24X3Y3Z4+19X2Y6Z2+8X2Y4Z4+8X2Y2Z6+104X4Y2Z2+96X3Y3Z2+146X2Y4Z2+384X2Y3Z3+18X2Y2Z4+6X4YZ2+144X3Y3Z+18X3Y2Z2+78X2Y3Z2+6XY4Z2+576XY3Z3+18X3YZ2+498X2Y2Z2+12X2YZ3+48XY4Z+18XY3Z2+18XY2Z3+36X3YZ+24X2Y2Z+114XY3Z+48XY2Z2+48XYZ3+156X2YZ+264XY2Z+108XYZ2+252XYZ16X12Y10Z824X12Y10Z412X8Y8Z8X8Y6Z8X6Y8Z84X6Y6Z813X8Y4Z416X6Y6Z417X4Y8Z464X4Y6Z696X6Y5Z4X8Y2Z424X6Y6Z23X6Y4Z413X4Y6Z4X2Y8Z496X2Y6Z6144X6Y5Z23X6Y2Z4148X4Y4Z42X4Y2Z68X2Y8Z23X2Y6Z43X2Y4Z66X4Y3Z46X3Y4Z46X6Y2Z24X4Y4Z224X3Y3Z419X2Y6Z28X2Y4Z48X2Y2Z6104X4Y2Z296X3Y3Z2146X2Y4Z2384X2Y3Z318X2Y2Z46X4YZ2144X3Y3Z18X3Y2Z278X2Y3Z26XY4Z2576XY3Z318X3YZ2498X2Y2Z212X2YZ348XY4Z18XY3Z218XY2Z336X3YZ24X2Y2Z114XY3Z48XY2Z248XYZ3156X2YZ264XY2Z108XYZ2252XYZ16*X^12*Y^10*Z^8+24*X^12*Y^10*Z^4+12*X^8*Y^8*Z^8+X^8*Y^6*Z^8+X^6*Y^8*Z^8+4*X^6*Y^6*Z^8+13*X^8*Y^4*Z^4+16*X^6*Y^6*Z^4+17*X^4*Y^8*Z^4+64*X^4*Y^6*Z^6+96*X^6*Y^5*Z^4+X^8*Y^2*Z^4+24*X^6*Y^6*Z^2+3*X^6*Y^4*Z^4+13*X^4*Y^6*Z^4+X^2*Y^8*Z^4+96*X^2*Y^6*Z^6+144*X^6*Y^5*Z^2+3*X^6*Y^2*Z^4+148*X^4*Y^4*Z^4+2*X^4*Y^2*Z^6+8*X^2*Y^8*Z^2+3*X^2*Y^6*Z^4+3*X^2*Y^4*Z^6+6*X^4*Y^3*Z^4+6*X^3*Y^4*Z^4+6*X^6*Y^2*Z^2+4*X^4*Y^4*Z^2+24*X^3*Y^3*Z^4+19*X^2*Y^6*Z^2+8*X^2*Y^4*Z^4+8*X^2*Y^2*Z^6+104*X^4*Y^2*Z^2+96*X^3*Y^3*Z^2+146*X^2*Y^4*Z^2+384*X^2*Y^3*Z^3+18*X^2*Y^2*Z^4+6*X^4*Y*Z^2+144*X^3*Y^3*Z+18*X^3*Y^2*Z^2+78*X^2*Y^3*Z^2+6*X*Y^4*Z^2+576*X*Y^3*Z^3+18*X^3*Y*Z^2+498*X^2*Y^2*Z^2+12*X^2*Y*Z^3+48*X*Y^4*Z+18*X*Y^3*Z^2+18*X*Y^2*Z^3+36*X^3*Y*Z+24*X^2*Y^2*Z+114*X*Y^3*Z+48*X*Y^2*Z^2+48*X*Y*Z^3+156*X^2*Y*Z+264*X*Y^2*Z+108*X*Y*Z^2+252*X*Y*Z

Algorithm definition

The algorithm ⟨12×22×26:4032⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨6×11×13:576⟩.

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