Description of fast matrix multiplication algorithm: ⟨2×3×22:110⟩

Algorithm type

22X2Y2Z2+16XY3Z+12XY2Z+60XYZ22X2Y2Z216XY3Z12XY2Z60XYZ22*X^2*Y^2*Z^2+16*X*Y^3*Z+12*X*Y^2*Z+60*X*Y*Z

Algorithm definition

The algorithm ⟨2×3×22:110⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×3×11:55⟩.

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