Description of fast matrix multiplication algorithm: ⟨2×13×26:520⟩

Algorithm type

156X2Y2Z2+40XY3Z+52XY2Z+272XYZ156X2Y2Z240XY3Z52XY2Z272XYZ156*X^2*Y^2*Z^2+40*X*Y^3*Z+52*X*Y^2*Z+272*X*Y*Z

Algorithm definition

The algorithm ⟨2×13×26:520⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×13×13:260⟩.

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