Description of fast matrix multiplication algorithm: ⟨8×20×22:2156⟩

Algorithm type

X8Y14Z8+X8Y14Z6+8X8Y8Z8+X8Y8Z6+X8Y6Z8+4X4Y14Z4+X8Y6Z6+4X4Y12Z4+X4Y12Z2+3X4Y10Z4+9X4Y8Z4+6X4Y7Z4+6X4Y7Z3+X4Y6Z4+128X4Y4Z4+12X2Y8Z2+6X4Y4Z3+6X4Y3Z4+24X2Y7Z2+X4Y4Z2+6X4Y3Z3+60X2Y6Z2+6X2Y6Z+18X2Y5Z2+96X2Y4Z2+6X2Y3Z2+582X2Y2Z2+72XY4Z+6X2Y2Z+216XY3Z+252XY2Z+612XYZX8Y14Z8X8Y14Z68X8Y8Z8X8Y8Z6X8Y6Z84X4Y14Z4X8Y6Z64X4Y12Z4X4Y12Z23X4Y10Z49X4Y8Z46X4Y7Z46X4Y7Z3X4Y6Z4128X4Y4Z412X2Y8Z26X4Y4Z36X4Y3Z424X2Y7Z2X4Y4Z26X4Y3Z360X2Y6Z26X2Y6Z18X2Y5Z296X2Y4Z26X2Y3Z2582X2Y2Z272XY4Z6X2Y2Z216XY3Z252XY2Z612XYZX^8*Y^14*Z^8+X^8*Y^14*Z^6+8*X^8*Y^8*Z^8+X^8*Y^8*Z^6+X^8*Y^6*Z^8+4*X^4*Y^14*Z^4+X^8*Y^6*Z^6+4*X^4*Y^12*Z^4+X^4*Y^12*Z^2+3*X^4*Y^10*Z^4+9*X^4*Y^8*Z^4+6*X^4*Y^7*Z^4+6*X^4*Y^7*Z^3+X^4*Y^6*Z^4+128*X^4*Y^4*Z^4+12*X^2*Y^8*Z^2+6*X^4*Y^4*Z^3+6*X^4*Y^3*Z^4+24*X^2*Y^7*Z^2+X^4*Y^4*Z^2+6*X^4*Y^3*Z^3+60*X^2*Y^6*Z^2+6*X^2*Y^6*Z+18*X^2*Y^5*Z^2+96*X^2*Y^4*Z^2+6*X^2*Y^3*Z^2+582*X^2*Y^2*Z^2+72*X*Y^4*Z+6*X^2*Y^2*Z+216*X*Y^3*Z+252*X*Y^2*Z+612*X*Y*Z

Algorithm definition

The algorithm ⟨8×20×22:2156⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×10×11:308⟩.

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