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

Algorithm type

192X2Y2Z2+72XY2Z+72XYZ2+72XYZ192X2Y2Z272XY2Z72XYZ272XYZ192*X^2*Y^2*Z^2+72*X*Y^2*Z+72*X*Y*Z^2+72*X*Y*Z

Algorithm definition

The algorithm ⟨5×10×12:408⟩ is the (Kronecker) tensor product of ⟨5×5×12:204⟩ with ⟨1×2×1:2⟩.

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