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

Algorithm type

16X8Y16Z8+16X8Y14Z8+17X4Y18Z4+16X4Y16Z4+18X4Y14Z4+19X2Y18Z2+25X4Y12Z4+3X2Y16Z2+20X4Y10Z4+13X2Y14Z2+124X4Y8Z4+37X2Y12Z2+96X4Y7Z4+47X4Y6Z4+24X2Y10Z2+102X2Y9Z2+45X4Y4Z4+129X2Y8Z2+108X2Y7Z2+114XY9Z+2X4Y2Z4+254X2Y6Z2+18XY8Z+120X2Y5Z2+78XY7Z+225X2Y4Z2+222XY6Z+282X2Y3Z2+144XY5Z+326X2Y2Z2+198XY4Z+12X2YZ2+624XY3Z+342XY2Z+336XYZ16X8Y16Z816X8Y14Z817X4Y18Z416X4Y16Z418X4Y14Z419X2Y18Z225X4Y12Z43X2Y16Z220X4Y10Z413X2Y14Z2124X4Y8Z437X2Y12Z296X4Y7Z447X4Y6Z424X2Y10Z2102X2Y9Z245X4Y4Z4129X2Y8Z2108X2Y7Z2114XY9Z2X4Y2Z4254X2Y6Z218XY8Z120X2Y5Z278XY7Z225X2Y4Z2222XY6Z282X2Y3Z2144XY5Z326X2Y2Z2198XY4Z12X2YZ2624XY3Z342XY2Z336XYZ16*X^8*Y^16*Z^8+16*X^8*Y^14*Z^8+17*X^4*Y^18*Z^4+16*X^4*Y^16*Z^4+18*X^4*Y^14*Z^4+19*X^2*Y^18*Z^2+25*X^4*Y^12*Z^4+3*X^2*Y^16*Z^2+20*X^4*Y^10*Z^4+13*X^2*Y^14*Z^2+124*X^4*Y^8*Z^4+37*X^2*Y^12*Z^2+96*X^4*Y^7*Z^4+47*X^4*Y^6*Z^4+24*X^2*Y^10*Z^2+102*X^2*Y^9*Z^2+45*X^4*Y^4*Z^4+129*X^2*Y^8*Z^2+108*X^2*Y^7*Z^2+114*X*Y^9*Z+2*X^4*Y^2*Z^4+254*X^2*Y^6*Z^2+18*X*Y^8*Z+120*X^2*Y^5*Z^2+78*X*Y^7*Z+225*X^2*Y^4*Z^2+222*X*Y^6*Z+282*X^2*Y^3*Z^2+144*X*Y^5*Z+326*X^2*Y^2*Z^2+198*X*Y^4*Z+12*X^2*Y*Z^2+624*X*Y^3*Z+342*X*Y^2*Z+336*X*Y*Z

Algorithm definition

The algorithm ⟨8×30×30:4172⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×15×15:596⟩.

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