Description of fast matrix multiplication algorithm: ⟨6×12×14:658⟩

Algorithm type

16X6Y6Z4+24X6Y6Z2+18X4Y4Z4+18X4Y2Z2+96X3Y3Z2+18X2Y4Z2+144X3Y3Z+108X2Y2Z2+108X2YZ+108XY2Z16X6Y6Z424X6Y6Z218X4Y4Z418X4Y2Z296X3Y3Z218X2Y4Z2144X3Y3Z108X2Y2Z2108X2YZ108XY2Z16*X^6*Y^6*Z^4+24*X^6*Y^6*Z^2+18*X^4*Y^4*Z^4+18*X^4*Y^2*Z^2+96*X^3*Y^3*Z^2+18*X^2*Y^4*Z^2+144*X^3*Y^3*Z+108*X^2*Y^2*Z^2+108*X^2*Y*Z+108*X*Y^2*Z

Algorithm definition

The algorithm ⟨6×12×14:658⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨3×6×7:94⟩.

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