Description of fast matrix multiplication algorithm: ⟨3×15×20:675⟩

Algorithm type

240X2Y3Z3+360XY3Z3+15X2Y2Z2+30X2YZ+30XYZ240X2Y3Z3360XY3Z315X2Y2Z230X2YZ30XYZ240*X^2*Y^3*Z^3+360*X*Y^3*Z^3+15*X^2*Y^2*Z^2+30*X^2*Y*Z+30*X*Y*Z

Algorithm definition

The algorithm ⟨3×15×20:675⟩ is the (Kronecker) tensor product of ⟨3×3×20:135⟩ with ⟨1×5×1:5⟩.

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