Description of fast matrix multiplication algorithm: ⟨3×6×20:270⟩

Algorithm type

96X2Y3Z3+144XY3Z3+6X2Y2Z2+12X2YZ+12XYZ96X2Y3Z3144XY3Z36X2Y2Z212X2YZ12XYZ96*X^2*Y^3*Z^3+144*X*Y^3*Z^3+6*X^2*Y^2*Z^2+12*X^2*Y*Z+12*X*Y*Z

Algorithm definition

The algorithm ⟨3×6×20:270⟩ is the (Kronecker) tensor product of ⟨3×3×20:135⟩ 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