Description of fast matrix multiplication algorithm: ⟨2×15×30:690⟩

Algorithm type

210X2Y2Z2+48XY3Z+60XY2Z+372XYZ210X2Y2Z248XY3Z60XY2Z372XYZ210*X^2*Y^2*Z^2+48*X*Y^3*Z+60*X*Y^2*Z+372*X*Y*Z

Algorithm definition

The algorithm ⟨2×15×30:690⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×15×15:345⟩.

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