Description of fast matrix multiplication algorithm: ⟨2×3×25:125⟩

Algorithm type

25X2Y2Z2+10XY3Z+30XY2Z+60XYZ25X2Y2Z210XY3Z30XY2Z60XYZ25*X^2*Y^2*Z^2+10*X*Y^3*Z+30*X*Y^2*Z+60*X*Y*Z

Algorithm definition

The algorithm ⟨2×3×25:125⟩ is the (Kronecker) tensor product of ⟨1×1×5:5⟩ with ⟨2×3×5:25⟩.

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