Description of fast matrix multiplication algorithm: ⟨2×8×30:375⟩

Algorithm type

6XY8Z+3X2Y5Z2+3XY7Z+6X2Y4Z2+21XY6Z+45X2Y3Z2+15XY5Z+51X2Y2Z2+24XY4Z+27XY3Z+48XY2Z+126XYZ6XY8Z3X2Y5Z23XY7Z6X2Y4Z221XY6Z45X2Y3Z215XY5Z51X2Y2Z224XY4Z27XY3Z48XY2Z126XYZ6*X*Y^8*Z+3*X^2*Y^5*Z^2+3*X*Y^7*Z+6*X^2*Y^4*Z^2+21*X*Y^6*Z+45*X^2*Y^3*Z^2+15*X*Y^5*Z+51*X^2*Y^2*Z^2+24*X*Y^4*Z+27*X*Y^3*Z+48*X*Y^2*Z+126*X*Y*Z

Algorithm definition

The algorithm ⟨2×8×30:375⟩ is the (Kronecker) tensor product of ⟨2×8×10:125⟩ with ⟨1×1×3:3⟩.

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