Description of fast matrix multiplication algorithm: ⟨15×21×24:4160⟩

Algorithm type

576⁢X4⁢Y6⁢Z6+864⁢X2⁢Y6⁢Z6+32⁢X4⁢Y6⁢Z3+304⁢X2⁢Y6⁢Z3+128⁢X2⁢Y3⁢Z6+320⁢X4⁢Y3⁢Z3+384⁢X⁢Y6⁢Z3+192⁢X⁢Y3⁢Z6+832⁢X2⁢Y3⁢Z3+528⁢X⁢Y3⁢Z3576X4Y6Z6864X2Y6Z632X4Y6Z3304X2Y6Z3128X2Y3Z6320X4Y3Z3384XY6Z3192XY3Z6832X2Y3Z3528XY3Z3576*X^4*Y^6*Z^6+864*X^2*Y^6*Z^6+32*X^4*Y^6*Z^3+304*X^2*Y^6*Z^3+128*X^2*Y^3*Z^6+320*X^4*Y^3*Z^3+384*X*Y^6*Z^3+192*X*Y^3*Z^6+832*X^2*Y^3*Z^3+528*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨15×21×24:4160⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨5×7×4:104⟩.

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