Description of fast matrix multiplication algorithm: ⟨4×5×24:366⟩

Algorithm type

3X4Y4Z4+3X4Y3Z4+3X3Y4Z4+3X3Y3Z4+9X2Y5Z2+3XY5Z2+81X2Y2Z2+6X2YZ2+36XY3Z+3XY2Z2+216XYZ3X4Y4Z43X4Y3Z43X3Y4Z43X3Y3Z49X2Y5Z23XY5Z281X2Y2Z26X2YZ236XY3Z3XY2Z2216XYZ3*X^4*Y^4*Z^4+3*X^4*Y^3*Z^4+3*X^3*Y^4*Z^4+3*X^3*Y^3*Z^4+9*X^2*Y^5*Z^2+3*X*Y^5*Z^2+81*X^2*Y^2*Z^2+6*X^2*Y*Z^2+36*X*Y^3*Z+3*X*Y^2*Z^2+216*X*Y*Z

Algorithm definition

The algorithm ⟨4×5×24:366⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ 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