Description of fast matrix multiplication algorithm: ⟨14×18×25:3694⟩

Algorithm type

4X4Y8Z6+5X8Y4Z4+48X4Y8Z4+4X2Y12Z2+2X8Y3Z3+22X4Y4Z6+4X2Y4Z8+8XY12Z+8X2Y8Z3+8X6Y4Z2+3X6Y2Z4+277X4Y4Z4+100X2Y8Z2+8X2Y4Z6+22X2Y2Z8+3X6Y2Z3+16X2Y6Z3+16XY9Z+50X6Y2Z2+24X4Y4Z2+66X4Y2Z4+214X2Y6Z2+28X2Y4Z4+44X2Y2Z6+8XY8Z+10X4Y2Z3+8X2Y4Z3+8XY4Z4+162X4Y2Z2+16X3Y4Z+146X2Y4Z2+154X2Y2Z4+24XY6Z+16XY4Z3+16XY3Z4+2X4Y2Z+2X4YZ2+32X3Y3Z+14X3YZ3+48X2Y4Z+48X2Y3Z2+39X2Y2Z3+56XY4Z2+32XY3Z3+8XY2Z4+26X4YZ+16X3Y2Z+32X3YZ2+96X2Y3Z+485X2Y2Z2+16XY4Z+112XY3Z2+16XY2Z3+36XYZ4+110X3YZ+48X2Y2Z+108X2YZ2+52XY3Z+56XY2Z2+76XYZ3+216X2YZ+44XY2Z+262XYZ2+54XYZ4X4Y8Z65X8Y4Z448X4Y8Z44X2Y12Z22X8Y3Z322X4Y4Z64X2Y4Z88XY12Z8X2Y8Z38X6Y4Z23X6Y2Z4277X4Y4Z4100X2Y8Z28X2Y4Z622X2Y2Z83X6Y2Z316X2Y6Z316XY9Z50X6Y2Z224X4Y4Z266X4Y2Z4214X2Y6Z228X2Y4Z444X2Y2Z68XY8Z10X4Y2Z38X2Y4Z38XY4Z4162X4Y2Z216X3Y4Z146X2Y4Z2154X2Y2Z424XY6Z16XY4Z316XY3Z42X4Y2Z2X4YZ232X3Y3Z14X3YZ348X2Y4Z48X2Y3Z239X2Y2Z356XY4Z232XY3Z38XY2Z426X4YZ16X3Y2Z32X3YZ296X2Y3Z485X2Y2Z216XY4Z112XY3Z216XY2Z336XYZ4110X3YZ48X2Y2Z108X2YZ252XY3Z56XY2Z276XYZ3216X2YZ44XY2Z262XYZ254XYZ4*X^4*Y^8*Z^6+5*X^8*Y^4*Z^4+48*X^4*Y^8*Z^4+4*X^2*Y^12*Z^2+2*X^8*Y^3*Z^3+22*X^4*Y^4*Z^6+4*X^2*Y^4*Z^8+8*X*Y^12*Z+8*X^2*Y^8*Z^3+8*X^6*Y^4*Z^2+3*X^6*Y^2*Z^4+277*X^4*Y^4*Z^4+100*X^2*Y^8*Z^2+8*X^2*Y^4*Z^6+22*X^2*Y^2*Z^8+3*X^6*Y^2*Z^3+16*X^2*Y^6*Z^3+16*X*Y^9*Z+50*X^6*Y^2*Z^2+24*X^4*Y^4*Z^2+66*X^4*Y^2*Z^4+214*X^2*Y^6*Z^2+28*X^2*Y^4*Z^4+44*X^2*Y^2*Z^6+8*X*Y^8*Z+10*X^4*Y^2*Z^3+8*X^2*Y^4*Z^3+8*X*Y^4*Z^4+162*X^4*Y^2*Z^2+16*X^3*Y^4*Z+146*X^2*Y^4*Z^2+154*X^2*Y^2*Z^4+24*X*Y^6*Z+16*X*Y^4*Z^3+16*X*Y^3*Z^4+2*X^4*Y^2*Z+2*X^4*Y*Z^2+32*X^3*Y^3*Z+14*X^3*Y*Z^3+48*X^2*Y^4*Z+48*X^2*Y^3*Z^2+39*X^2*Y^2*Z^3+56*X*Y^4*Z^2+32*X*Y^3*Z^3+8*X*Y^2*Z^4+26*X^4*Y*Z+16*X^3*Y^2*Z+32*X^3*Y*Z^2+96*X^2*Y^3*Z+485*X^2*Y^2*Z^2+16*X*Y^4*Z+112*X*Y^3*Z^2+16*X*Y^2*Z^3+36*X*Y*Z^4+110*X^3*Y*Z+48*X^2*Y^2*Z+108*X^2*Y*Z^2+52*X*Y^3*Z+56*X*Y^2*Z^2+76*X*Y*Z^3+216*X^2*Y*Z+44*X*Y^2*Z+262*X*Y*Z^2+54*X*Y*Z

Algorithm definition

The algorithm ⟨14×18×25:3694⟩ is serendipitous tensor product (⟨7×3×5:79⟩ - 5) ⊗ ⟨2×6×5:47⟩ +⟨10×6×5:216⟩.

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