Description of fast matrix multiplication algorithm: ⟨2×3×12:60⟩

Algorithm type

12X2Y2Z2+24XY2Z+24XYZ12X2Y2Z224XY2Z24XYZ12*X^2*Y^2*Z^2+24*X*Y^2*Z+24*X*Y*Z

Algorithm definition

The algorithm ⟨2×3×12:60⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×3×6:30⟩.

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