Description of fast matrix multiplication algorithm: ⟨6×6×20:483⟩

Algorithm type

16X4Y6Z6+24X2Y6Z6+7X4Y4Z4+X6Y2Z2+2X2Y6Z2+2X2Y4Z4+2X2Y2Z6+4X2Y4Z2+96X2Y3Z3+4X2Y2Z4+144XY3Z3+49X2Y2Z2+6X3YZ+12XY3Z+12XY2Z2+12XYZ3+24XY2Z+24XYZ2+42XYZ16X4Y6Z624X2Y6Z67X4Y4Z4X6Y2Z22X2Y6Z22X2Y4Z42X2Y2Z64X2Y4Z296X2Y3Z34X2Y2Z4144XY3Z349X2Y2Z26X3YZ12XY3Z12XY2Z212XYZ324XY2Z24XYZ242XYZ16*X^4*Y^6*Z^6+24*X^2*Y^6*Z^6+7*X^4*Y^4*Z^4+X^6*Y^2*Z^2+2*X^2*Y^6*Z^2+2*X^2*Y^4*Z^4+2*X^2*Y^2*Z^6+4*X^2*Y^4*Z^2+96*X^2*Y^3*Z^3+4*X^2*Y^2*Z^4+144*X*Y^3*Z^3+49*X^2*Y^2*Z^2+6*X^3*Y*Z+12*X*Y^3*Z+12*X*Y^2*Z^2+12*X*Y*Z^3+24*X*Y^2*Z+24*X*Y*Z^2+42*X*Y*Z

Algorithm definition

The algorithm ⟨6×6×20:483⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨3×3×10:69⟩.

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