Description of fast matrix multiplication algorithm: ⟨18×20×24:4676⟩

Algorithm type

64X8Y12Z12+44X6Y12Z12+48X4Y12Z12+4X2Y12Z12+32X10Y6Z6+64X8Y6Z6+21X10Y4Z4+176X6Y6Z6+15X8Y4Z4+476X4Y6Z6+264X3Y6Z6+324X2Y6Z6+24XY6Z6+24X6Y4Z2+24X6Y2Z4+192X5Y3Z3+6X4Y4Z2+384X4Y3Z3+6X4Y2Z4+126X5Y2Z2+1056X3Y3Z3+90X4Y2Z2+6X2Y4Z2+552X2Y3Z3+6X2Y2Z4+216XY3Z3+144X3Y2Z+144X3YZ2+36X2Y2Z+36X2YZ2+36XY2Z+36XYZ264X8Y12Z1244X6Y12Z1248X4Y12Z124X2Y12Z1232X10Y6Z664X8Y6Z621X10Y4Z4176X6Y6Z615X8Y4Z4476X4Y6Z6264X3Y6Z6324X2Y6Z624XY6Z624X6Y4Z224X6Y2Z4192X5Y3Z36X4Y4Z2384X4Y3Z36X4Y2Z4126X5Y2Z21056X3Y3Z390X4Y2Z26X2Y4Z2552X2Y3Z36X2Y2Z4216XY3Z3144X3Y2Z144X3YZ236X2Y2Z36X2YZ236XY2Z36XYZ264*X^8*Y^12*Z^12+44*X^6*Y^12*Z^12+48*X^4*Y^12*Z^12+4*X^2*Y^12*Z^12+32*X^10*Y^6*Z^6+64*X^8*Y^6*Z^6+21*X^10*Y^4*Z^4+176*X^6*Y^6*Z^6+15*X^8*Y^4*Z^4+476*X^4*Y^6*Z^6+264*X^3*Y^6*Z^6+324*X^2*Y^6*Z^6+24*X*Y^6*Z^6+24*X^6*Y^4*Z^2+24*X^6*Y^2*Z^4+192*X^5*Y^3*Z^3+6*X^4*Y^4*Z^2+384*X^4*Y^3*Z^3+6*X^4*Y^2*Z^4+126*X^5*Y^2*Z^2+1056*X^3*Y^3*Z^3+90*X^4*Y^2*Z^2+6*X^2*Y^4*Z^2+552*X^2*Y^3*Z^3+6*X^2*Y^2*Z^4+216*X*Y^3*Z^3+144*X^3*Y^2*Z+144*X^3*Y*Z^2+36*X^2*Y^2*Z+36*X^2*Y*Z^2+36*X*Y^2*Z+36*X*Y*Z^2

Algorithm definition

The algorithm ⟨18×20×24:4676⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨9×10×12:668⟩.

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