Description of fast matrix multiplication algorithm: ⟨3×4×18:168⟩

Algorithm type

6X2Y3Z2+42X2Y2Z2+18XY2Z+42XYZ2+60XYZ6X2Y3Z242X2Y2Z218XY2Z42XYZ260XYZ6*X^2*Y^3*Z^2+42*X^2*Y^2*Z^2+18*X*Y^2*Z+42*X*Y*Z^2+60*X*Y*Z

Algorithm definition

The algorithm ⟨3×4×18:168⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨3×4×6:56⟩.

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