Description of fast matrix multiplication algorithm: ⟨4×9×30:750⟩

Algorithm type

30X4Y4Z4+12X2Y6Z2+96X2Y4Z2+24XY6Z+132X2Y2Z2+72XY4Z+24XY3Z+216XY2Z+144XYZ30X4Y4Z412X2Y6Z296X2Y4Z224XY6Z132X2Y2Z272XY4Z24XY3Z216XY2Z144XYZ30*X^4*Y^4*Z^4+12*X^2*Y^6*Z^2+96*X^2*Y^4*Z^2+24*X*Y^6*Z+132*X^2*Y^2*Z^2+72*X*Y^4*Z+24*X*Y^3*Z+216*X*Y^2*Z+144*X*Y*Z

Algorithm definition

The algorithm ⟨4×9×30:750⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨2×3×10:50⟩.

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