Description of fast matrix multiplication algorithm: ⟨16×28×32:8036⟩

Algorithm type

3X16Y16Z16+X16Y12Z16+2X12Y12Z16+2X8Y20Z8+4X8Y16Z8+2X8Y12Z8+74X8Y8Z8+2X4Y12Z8+12X8Y6Z8+2X8Y4Z8+24X6Y6Z8+18X4Y12Z4+24X4Y10Z4+72X4Y8Z4+24X4Y6Z4+630X4Y4Z4+24X2Y6Z4+36X4Y3Z4+24X4Y2Z4+72X3Y3Z4+216X2Y6Z2+72X2Y5Z2+432X2Y4Z2+72X2Y3Z2+2160X2Y2Z2+72XY3Z2+72X2YZ2+648XY3Z+864XY2Z+2376XYZ3X16Y16Z16X16Y12Z162X12Y12Z162X8Y20Z84X8Y16Z82X8Y12Z874X8Y8Z82X4Y12Z812X8Y6Z82X8Y4Z824X6Y6Z818X4Y12Z424X4Y10Z472X4Y8Z424X4Y6Z4630X4Y4Z424X2Y6Z436X4Y3Z424X4Y2Z472X3Y3Z4216X2Y6Z272X2Y5Z2432X2Y4Z272X2Y3Z22160X2Y2Z272XY3Z272X2YZ2648XY3Z864XY2Z2376XYZ3*X^16*Y^16*Z^16+X^16*Y^12*Z^16+2*X^12*Y^12*Z^16+2*X^8*Y^20*Z^8+4*X^8*Y^16*Z^8+2*X^8*Y^12*Z^8+74*X^8*Y^8*Z^8+2*X^4*Y^12*Z^8+12*X^8*Y^6*Z^8+2*X^8*Y^4*Z^8+24*X^6*Y^6*Z^8+18*X^4*Y^12*Z^4+24*X^4*Y^10*Z^4+72*X^4*Y^8*Z^4+24*X^4*Y^6*Z^4+630*X^4*Y^4*Z^4+24*X^2*Y^6*Z^4+36*X^4*Y^3*Z^4+24*X^4*Y^2*Z^4+72*X^3*Y^3*Z^4+216*X^2*Y^6*Z^2+72*X^2*Y^5*Z^2+432*X^2*Y^4*Z^2+72*X^2*Y^3*Z^2+2160*X^2*Y^2*Z^2+72*X*Y^3*Z^2+72*X^2*Y*Z^2+648*X*Y^3*Z+864*X*Y^2*Z+2376*X*Y*Z

Algorithm definition

The algorithm ⟨16×28×32:8036⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×14×16:1148⟩.

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