Description of fast matrix multiplication algorithm: ⟨2×9×26:364⟩

Algorithm type

12XY6Z+6X2Y3Z2+26XY5Z+98X2Y2Z2+10XY4Z+4XY3Z+18XY2Z+190XYZ12XY6Z6X2Y3Z226XY5Z98X2Y2Z210XY4Z4XY3Z18XY2Z190XYZ12*X*Y^6*Z+6*X^2*Y^3*Z^2+26*X*Y^5*Z+98*X^2*Y^2*Z^2+10*X*Y^4*Z+4*X*Y^3*Z+18*X*Y^2*Z+190*X*Y*Z

Algorithm definition

The algorithm ⟨2×9×26:364⟩ is the (Kronecker) tensor product of ⟨2×9×13:182⟩ 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