Description of fast matrix multiplication algorithm: ⟨3×11×18:450⟩

Algorithm type

144X2Y3Z3+216XY3Z3+18X2Y2Z2+36XYZ2+36XYZ144X2Y3Z3216XY3Z318X2Y2Z236XYZ236XYZ144*X^2*Y^3*Z^3+216*X*Y^3*Z^3+18*X^2*Y^2*Z^2+36*X*Y*Z^2+36*X*Y*Z

Algorithm definition

The algorithm ⟨3×11×18:450⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨3×11×6:150⟩.

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