Description of fast matrix multiplication algorithm: ⟨6×8×28:882⟩

Algorithm type

12X4Y6Z4+30X4Y4Z4+4X2Y8Z2+12X4Y2Z4+24X2Y6Z2+24X2Y4Z2+72X2Y3Z2+200X2Y2Z2+24XY4Z+72X2YZ2+144XY3Z+144XY2Z+120XYZ12X4Y6Z430X4Y4Z44X2Y8Z212X4Y2Z424X2Y6Z224X2Y4Z272X2Y3Z2200X2Y2Z224XY4Z72X2YZ2144XY3Z144XY2Z120XYZ12*X^4*Y^6*Z^4+30*X^4*Y^4*Z^4+4*X^2*Y^8*Z^2+12*X^4*Y^2*Z^4+24*X^2*Y^6*Z^2+24*X^2*Y^4*Z^2+72*X^2*Y^3*Z^2+200*X^2*Y^2*Z^2+24*X*Y^4*Z+72*X^2*Y*Z^2+144*X*Y^3*Z+144*X*Y^2*Z+120*X*Y*Z

Algorithm definition

The algorithm ⟨6×8×28:882⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨6×8×14:441⟩.

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