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

Algorithm type

32X4Y6Z6+48X2Y6Z6+3X4Y4Z4+6X4Y2Z2+192X2Y3Z3+288XY3Z3+24X2Y2Z2+36X2YZ+36XYZ32X4Y6Z648X2Y6Z63X4Y4Z46X4Y2Z2192X2Y3Z3288XY3Z324X2Y2Z236X2YZ36XYZ32*X^4*Y^6*Z^6+48*X^2*Y^6*Z^6+3*X^4*Y^4*Z^4+6*X^4*Y^2*Z^2+192*X^2*Y^3*Z^3+288*X*Y^3*Z^3+24*X^2*Y^2*Z^2+36*X^2*Y*Z+36*X*Y*Z

Algorithm definition

The algorithm ⟨6×6×28:665⟩ is the (Kronecker) tensor product of ⟨3×3×14:95⟩ with ⟨2×2×2:7⟩.

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