Description of fast matrix multiplication algorithm: ⟨8×24×28:3164⟩

Algorithm type

2X8Y12Z8+14X8Y10Z8+8X4Y18Z4+6X8Y8Z8+12X4Y16Z4+23X4Y14Z4+23X4Y12Z4+9X2Y16Z2+32X4Y10Z4+33X2Y14Z2+18X4Y8Z4+22X2Y12Z2+38X4Y6Z4+19X2Y10Z2+84X4Y5Z4+48X2Y9Z2+56X4Y4Z4+81X2Y8Z2+138X2Y7Z2+259X2Y6Z2+54XY8Z+192X2Y5Z2+198XY7Z+130X2Y4Z2+132XY6Z+156X2Y3Z2+114XY5Z+153X2Y2Z2+54XY4Z+726XY3Z+132XY2Z+198XYZ2X8Y12Z814X8Y10Z88X4Y18Z46X8Y8Z812X4Y16Z423X4Y14Z423X4Y12Z49X2Y16Z232X4Y10Z433X2Y14Z218X4Y8Z422X2Y12Z238X4Y6Z419X2Y10Z284X4Y5Z448X2Y9Z256X4Y4Z481X2Y8Z2138X2Y7Z2259X2Y6Z254XY8Z192X2Y5Z2198XY7Z130X2Y4Z2132XY6Z156X2Y3Z2114XY5Z153X2Y2Z254XY4Z726XY3Z132XY2Z198XYZ2*X^8*Y^12*Z^8+14*X^8*Y^10*Z^8+8*X^4*Y^18*Z^4+6*X^8*Y^8*Z^8+12*X^4*Y^16*Z^4+23*X^4*Y^14*Z^4+23*X^4*Y^12*Z^4+9*X^2*Y^16*Z^2+32*X^4*Y^10*Z^4+33*X^2*Y^14*Z^2+18*X^4*Y^8*Z^4+22*X^2*Y^12*Z^2+38*X^4*Y^6*Z^4+19*X^2*Y^10*Z^2+84*X^4*Y^5*Z^4+48*X^2*Y^9*Z^2+56*X^4*Y^4*Z^4+81*X^2*Y^8*Z^2+138*X^2*Y^7*Z^2+259*X^2*Y^6*Z^2+54*X*Y^8*Z+192*X^2*Y^5*Z^2+198*X*Y^7*Z+130*X^2*Y^4*Z^2+132*X*Y^6*Z+156*X^2*Y^3*Z^2+114*X*Y^5*Z+153*X^2*Y^2*Z^2+54*X*Y^4*Z+726*X*Y^3*Z+132*X*Y^2*Z+198*X*Y*Z

Algorithm definition

The algorithm ⟨8×24×28:3164⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×12×14:452⟩.

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