Description of fast matrix multiplication algorithm: ⟨3×17×30:1148⟩

Algorithm type

320X3Y3Z2+480X3Y3Z+6X3Y2Z+102X2Y2Z2+12XY4Z+6XY2Z3+30X3YZ+12X2Y2Z+6XY3Z+12XY2Z2+30XYZ3+6X2YZ+78XY2Z+6XYZ2+42XYZ320X3Y3Z2480X3Y3Z6X3Y2Z102X2Y2Z212XY4Z6XY2Z330X3YZ12X2Y2Z6XY3Z12XY2Z230XYZ36X2YZ78XY2Z6XYZ242XYZ320*X^3*Y^3*Z^2+480*X^3*Y^3*Z+6*X^3*Y^2*Z+102*X^2*Y^2*Z^2+12*X*Y^4*Z+6*X*Y^2*Z^3+30*X^3*Y*Z+12*X^2*Y^2*Z+6*X*Y^3*Z+12*X*Y^2*Z^2+30*X*Y*Z^3+6*X^2*Y*Z+78*X*Y^2*Z+6*X*Y*Z^2+42*X*Y*Z

Algorithm definition

The algorithm ⟨3×17×30:1148⟩ is the (Kronecker) tensor product of ⟨3×17×15:574⟩ with ⟨1×1×2:2⟩.

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