Description of fast matrix multiplication algorithm: ⟨16×24×28:5901⟩

Algorithm type

4X8Y12Z8+16X8Y10Z8+28X8Y8Z8+16X8Y6Z8+29X4Y12Z4+18X4Y10Z4+69X4Y8Z4+X2Y12Z2+128X4Y6Z4+X2Y10Z2+96X4Y5Z4+2X4Y6Z2+289X4Y4Z4+12X2Y8Z2+9X2Y6Z4+96X4Y3Z4+10X4Y4Z2+305X2Y6Z2+11X2Y4Z4+108X2Y5Z2+6X4Y2Z2+600X2Y4Z2+7X2Y2Z4+6XY6Z+624X2Y3Z2+6XY5Z+12X2Y3Z+788X2Y2Z2+72XY4Z+54XY3Z2+60X2Y2Z+786XY3Z+66XY2Z2+36X2YZ+1116XY2Z+42XYZ2+372XYZ4X8Y12Z816X8Y10Z828X8Y8Z816X8Y6Z829X4Y12Z418X4Y10Z469X4Y8Z4X2Y12Z2128X4Y6Z4X2Y10Z296X4Y5Z42X4Y6Z2289X4Y4Z412X2Y8Z29X2Y6Z496X4Y3Z410X4Y4Z2305X2Y6Z211X2Y4Z4108X2Y5Z26X4Y2Z2600X2Y4Z27X2Y2Z46XY6Z624X2Y3Z26XY5Z12X2Y3Z788X2Y2Z272XY4Z54XY3Z260X2Y2Z786XY3Z66XY2Z236X2YZ1116XY2Z42XYZ2372XYZ4*X^8*Y^12*Z^8+16*X^8*Y^10*Z^8+28*X^8*Y^8*Z^8+16*X^8*Y^6*Z^8+29*X^4*Y^12*Z^4+18*X^4*Y^10*Z^4+69*X^4*Y^8*Z^4+X^2*Y^12*Z^2+128*X^4*Y^6*Z^4+X^2*Y^10*Z^2+96*X^4*Y^5*Z^4+2*X^4*Y^6*Z^2+289*X^4*Y^4*Z^4+12*X^2*Y^8*Z^2+9*X^2*Y^6*Z^4+96*X^4*Y^3*Z^4+10*X^4*Y^4*Z^2+305*X^2*Y^6*Z^2+11*X^2*Y^4*Z^4+108*X^2*Y^5*Z^2+6*X^4*Y^2*Z^2+600*X^2*Y^4*Z^2+7*X^2*Y^2*Z^4+6*X*Y^6*Z+624*X^2*Y^3*Z^2+6*X*Y^5*Z+12*X^2*Y^3*Z+788*X^2*Y^2*Z^2+72*X*Y^4*Z+54*X*Y^3*Z^2+60*X^2*Y^2*Z+786*X*Y^3*Z+66*X*Y^2*Z^2+36*X^2*Y*Z+1116*X*Y^2*Z+42*X*Y*Z^2+372*X*Y*Z

Algorithm definition

The algorithm ⟨16×24×28:5901⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×12×14:843⟩.

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