Description of fast matrix multiplication algorithm: ⟨5×5×12:220⟩

Algorithm type

80X2Y2Z2+4X3YZ+2X2YZ2+6XY3Z+2XY2Z2+6XYZ3+24X2YZ+28XY2Z+26XYZ2+42XYZ80X2Y2Z24X3YZ2X2YZ26XY3Z2XY2Z26XYZ324X2YZ28XY2Z26XYZ242XYZ80*X^2*Y^2*Z^2+4*X^3*Y*Z+2*X^2*Y*Z^2+6*X*Y^3*Z+2*X*Y^2*Z^2+6*X*Y*Z^3+24*X^2*Y*Z+28*X*Y^2*Z+26*X*Y*Z^2+42*X*Y*Z

Algorithm definition

The algorithm ⟨5×5×12:220⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨5×5×6:110⟩.

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