Description of fast matrix multiplication algorithm: ⟨3×4×30:280⟩

Algorithm type

10X2Y3Z2+70X2Y2Z2+30XY2Z+70XYZ2+100XYZ10X2Y3Z270X2Y2Z230XY2Z70XYZ2100XYZ10*X^2*Y^3*Z^2+70*X^2*Y^2*Z^2+30*X*Y^2*Z+70*X*Y*Z^2+100*X*Y*Z

Algorithm definition

The algorithm ⟨3×4×30:280⟩ is the (Kronecker) tensor product of ⟨1×1×5:5⟩ 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