Description of fast matrix multiplication algorithm: ⟨3×8×20:360⟩

Algorithm type

24⁢X2⁢Y3⁢Z2+96⁢X2⁢Y2⁢Z2+8⁢X⁢Y4⁢Z+24⁢X2⁢Y⁢Z2+48⁢X⁢Y3⁢Z+84⁢X⁢Y2⁢Z+36⁢X⁢Y⁢Z2+40⁢X⁢Y⁢Z24X2Y3Z296X2Y2Z28XY4Z24X2YZ248XY3Z84XY2Z36XYZ240XYZ24*X^2*Y^3*Z^2+96*X^2*Y^2*Z^2+8*X*Y^4*Z+24*X^2*Y*Z^2+48*X*Y^3*Z+84*X*Y^2*Z+36*X*Y*Z^2+40*X*Y*Z

Algorithm definition

The algorithm ⟨3×8×20:360⟩ is the (Kronecker) tensor product of ⟨1×2×1:2⟩ with ⟨3×4×20:180⟩.

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