Description of fast matrix multiplication algorithm: ⟨4×9×21:525⟩

Algorithm type

21X4Y4Z4+12X2Y6Z2+60X2Y4Z2+24XY6Z+96X2Y2Z2+36XY4Z+24XY3Z+144XY2Z+108XYZ21X4Y4Z412X2Y6Z260X2Y4Z224XY6Z96X2Y2Z236XY4Z24XY3Z144XY2Z108XYZ21*X^4*Y^4*Z^4+12*X^2*Y^6*Z^2+60*X^2*Y^4*Z^2+24*X*Y^6*Z+96*X^2*Y^2*Z^2+36*X*Y^4*Z+24*X*Y^3*Z+144*X*Y^2*Z+108*X*Y*Z

Algorithm definition

The algorithm ⟨4×9×21:525⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨2×3×7:35⟩.

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