Description of fast matrix multiplication algorithm: ⟨4×5×16:244⟩

Algorithm type

2X4Y4Z4+2X4Y3Z4+2X3Y4Z4+2X3Y3Z4+6X2Y5Z2+2XY5Z2+54X2Y2Z2+4X2YZ2+24XY3Z+2XY2Z2+144XYZ2X4Y4Z42X4Y3Z42X3Y4Z42X3Y3Z46X2Y5Z22XY5Z254X2Y2Z24X2YZ224XY3Z2XY2Z2144XYZ2*X^4*Y^4*Z^4+2*X^4*Y^3*Z^4+2*X^3*Y^4*Z^4+2*X^3*Y^3*Z^4+6*X^2*Y^5*Z^2+2*X*Y^5*Z^2+54*X^2*Y^2*Z^2+4*X^2*Y*Z^2+24*X*Y^3*Z+2*X*Y^2*Z^2+144*X*Y*Z

Algorithm definition

The algorithm ⟨4×5×16:244⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×5×8:122⟩.

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