Description of fast matrix multiplication algorithm: ⟨2×9×28:392⟩

Algorithm type

2XY7Z+8XY6Z+4X2Y3Z2+26XY5Z+108X2Y2Z2+18XY4Z+2XY3Z+12XY2Z+212XYZ2XY7Z8XY6Z4X2Y3Z226XY5Z108X2Y2Z218XY4Z2XY3Z12XY2Z212XYZ2*X*Y^7*Z+8*X*Y^6*Z+4*X^2*Y^3*Z^2+26*X*Y^5*Z+108*X^2*Y^2*Z^2+18*X*Y^4*Z+2*X*Y^3*Z+12*X*Y^2*Z+212*X*Y*Z

Algorithm definition

The algorithm ⟨2×9×28:392⟩ is the (Kronecker) tensor product of ⟨2×9×14:196⟩ with ⟨1×1×2:2⟩.

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