Description of fast matrix multiplication algorithm: ⟨2×3×6:30⟩

Algorithm type

6X2Y2Z2+12XY2Z+12XYZ6X2Y2Z212XY2Z12XYZ6*X^2*Y^2*Z^2+12*X*Y^2*Z+12*X*Y*Z

Algorithm definition

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

Algorithm description

Algorithm symmetries

The following group of 12 isotropies acts as a permutation group on algorithm tensor representation:

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