Description of fast matrix multiplication algorithm: ⟨4×9×15:375⟩

Algorithm type

15X4Y4Z4+6X2Y6Z2+48X2Y4Z2+12XY6Z+66X2Y2Z2+36XY4Z+12XY3Z+108XY2Z+72XYZ15X4Y4Z46X2Y6Z248X2Y4Z212XY6Z66X2Y2Z236XY4Z12XY3Z108XY2Z72XYZ15*X^4*Y^4*Z^4+6*X^2*Y^6*Z^2+48*X^2*Y^4*Z^2+12*X*Y^6*Z+66*X^2*Y^2*Z^2+36*X*Y^4*Z+12*X*Y^3*Z+108*X*Y^2*Z+72*X*Y*Z

Algorithm definition

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