Description of fast matrix multiplication algorithm: ⟨4×9×20:500⟩

Algorithm type

20X4Y4Z4+8XY9Z+28X2Y6Z2+24X2Y4Z2+24XY6Z+108X2Y2Z2+72XY3Z+72XY2Z+144XYZ20X4Y4Z48XY9Z28X2Y6Z224X2Y4Z224XY6Z108X2Y2Z272XY3Z72XY2Z144XYZ20*X^4*Y^4*Z^4+8*X*Y^9*Z+28*X^2*Y^6*Z^2+24*X^2*Y^4*Z^2+24*X*Y^6*Z+108*X^2*Y^2*Z^2+72*X*Y^3*Z+72*X*Y^2*Z+144*X*Y*Z

Algorithm definition

The algorithm ⟨4×9×20:500⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ 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