Description of fast matrix multiplication algorithm: ⟨8×22×30:3143⟩

Algorithm type

X8Y12Z8+5X8Y10Z8+11X8Y8Z8+16X4Y14Z4+18X4Y12Z4+32X4Y10Z4+X4Y6Z8+16X2Y14Z2+32X4Y8Z4+20X2Y12Z2+X2Y10Z4+36X4Y6Z4+34X2Y10Z2+30X4Y5Z4+97X4Y4Z4+20X2Y8Z2+2X2Y6Z4+96X2Y7Z2+210X2Y6Z2+2X2Y4Z4+192X2Y5Z2+6X2Y3Z4+96XY7Z+239X2Y4Z2+X2Y2Z4+120XY6Z+6XY5Z2+180X2Y3Z2+204XY5Z+213X2Y2Z2+120XY4Z+12XY3Z2+612XY3Z+12XY2Z2+282XY2Z+6XYZ2+162XYZX8Y12Z85X8Y10Z811X8Y8Z816X4Y14Z418X4Y12Z432X4Y10Z4X4Y6Z816X2Y14Z232X4Y8Z420X2Y12Z2X2Y10Z436X4Y6Z434X2Y10Z230X4Y5Z497X4Y4Z420X2Y8Z22X2Y6Z496X2Y7Z2210X2Y6Z22X2Y4Z4192X2Y5Z26X2Y3Z496XY7Z239X2Y4Z2X2Y2Z4120XY6Z6XY5Z2180X2Y3Z2204XY5Z213X2Y2Z2120XY4Z12XY3Z2612XY3Z12XY2Z2282XY2Z6XYZ2162XYZX^8*Y^12*Z^8+5*X^8*Y^10*Z^8+11*X^8*Y^8*Z^8+16*X^4*Y^14*Z^4+18*X^4*Y^12*Z^4+32*X^4*Y^10*Z^4+X^4*Y^6*Z^8+16*X^2*Y^14*Z^2+32*X^4*Y^8*Z^4+20*X^2*Y^12*Z^2+X^2*Y^10*Z^4+36*X^4*Y^6*Z^4+34*X^2*Y^10*Z^2+30*X^4*Y^5*Z^4+97*X^4*Y^4*Z^4+20*X^2*Y^8*Z^2+2*X^2*Y^6*Z^4+96*X^2*Y^7*Z^2+210*X^2*Y^6*Z^2+2*X^2*Y^4*Z^4+192*X^2*Y^5*Z^2+6*X^2*Y^3*Z^4+96*X*Y^7*Z+239*X^2*Y^4*Z^2+X^2*Y^2*Z^4+120*X*Y^6*Z+6*X*Y^5*Z^2+180*X^2*Y^3*Z^2+204*X*Y^5*Z+213*X^2*Y^2*Z^2+120*X*Y^4*Z+12*X*Y^3*Z^2+612*X*Y^3*Z+12*X*Y^2*Z^2+282*X*Y^2*Z+6*X*Y*Z^2+162*X*Y*Z

Algorithm definition

The algorithm ⟨8×22×30:3143⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×11×15:449⟩.

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