Description of fast matrix multiplication algorithm: ⟨9×16×28:2394⟩

Algorithm type

60⁢X4⁢Y6⁢Z4+4⁢X⁢Y12⁢Z+12⁢X2⁢Y9⁢Z2+12⁢X4⁢Y6⁢Z2+150⁢X4⁢Y4⁢Z4+20⁢X2⁢Y8⁢Z2+12⁢X2⁢Y6⁢Z4+18⁢X6⁢Y3⁢Z2+4⁢X2⁢Y8⁢Z+18⁢X2⁢Y3⁢Z6+24⁢X⁢Y9⁢Z+4⁢X⁢Y8⁢Z2+45⁢X6⁢Y2⁢Z2+30⁢X4⁢Y4⁢Z2+60⁢X4⁢Y2⁢Z4+216⁢X2⁢Y6⁢Z2+30⁢X2⁢Y4⁢Z4+45⁢X2⁢Y2⁢Z6+22⁢X⁢Y8⁢Z+18⁢X6⁢Y⁢Z2+6⁢X4⁢Y3⁢Z2+24⁢X2⁢Y6⁢Z+6⁢X2⁢Y3⁢Z4+18⁢X2⁢Y⁢Z6+24⁢X⁢Y6⁢Z2+27⁢X4⁢Y2⁢Z2+6⁢X3⁢Y4⁢Z+285⁢X2⁢Y4⁢Z2+27⁢X2⁢Y2⁢Z4+156⁢X⁢Y6⁢Z+6⁢X⁢Y4⁢Z3+6⁢X4⁢Y⁢Z2+36⁢X3⁢Y3⁢Z+26⁢X2⁢Y4⁢Z+30⁢X2⁢Y3⁢Z2+6⁢X2⁢Y⁢Z4+26⁢X⁢Y4⁢Z2+36⁢X⁢Y3⁢Z3+36⁢X3⁢Y2⁢Z+12⁢X2⁢Y3⁢Z+211⁢X2⁢Y2⁢Z2+138⁢X⁢Y4⁢Z+12⁢X⁢Y3⁢Z2+36⁢X⁢Y2⁢Z3+30⁢X3⁢Y⁢Z+32⁢X2⁢Y2⁢Z+18⁢X2⁢Y⁢Z2+56⁢X⁢Y3⁢Z+32⁢X⁢Y2⁢Z2+30⁢X⁢Y⁢Z3+10⁢X2⁢Y⁢Z+146⁢X⁢Y2⁢Z+10⁢X⁢Y⁢Z2+30⁢X⁢Y⁢Z60X4Y6Z44XY12Z12X2Y9Z212X4Y6Z2150X4Y4Z420X2Y8Z212X2Y6Z418X6Y3Z24X2Y8Z18X2Y3Z624XY9Z4XY8Z245X6Y2Z230X4Y4Z260X4Y2Z4216X2Y6Z230X2Y4Z445X2Y2Z622XY8Z18X6YZ26X4Y3Z224X2Y6Z6X2Y3Z418X2YZ624XY6Z227X4Y2Z26X3Y4Z285X2Y4Z227X2Y2Z4156XY6Z6XY4Z36X4YZ236X3Y3Z26X2Y4Z30X2Y3Z26X2YZ426XY4Z236XY3Z336X3Y2Z12X2Y3Z211X2Y2Z2138XY4Z12XY3Z236XY2Z330X3YZ32X2Y2Z18X2YZ256XY3Z32XY2Z230XYZ310X2YZ146XY2Z10XYZ230XYZ60*X^4*Y^6*Z^4+4*X*Y^12*Z+12*X^2*Y^9*Z^2+12*X^4*Y^6*Z^2+150*X^4*Y^4*Z^4+20*X^2*Y^8*Z^2+12*X^2*Y^6*Z^4+18*X^6*Y^3*Z^2+4*X^2*Y^8*Z+18*X^2*Y^3*Z^6+24*X*Y^9*Z+4*X*Y^8*Z^2+45*X^6*Y^2*Z^2+30*X^4*Y^4*Z^2+60*X^4*Y^2*Z^4+216*X^2*Y^6*Z^2+30*X^2*Y^4*Z^4+45*X^2*Y^2*Z^6+22*X*Y^8*Z+18*X^6*Y*Z^2+6*X^4*Y^3*Z^2+24*X^2*Y^6*Z+6*X^2*Y^3*Z^4+18*X^2*Y*Z^6+24*X*Y^6*Z^2+27*X^4*Y^2*Z^2+6*X^3*Y^4*Z+285*X^2*Y^4*Z^2+27*X^2*Y^2*Z^4+156*X*Y^6*Z+6*X*Y^4*Z^3+6*X^4*Y*Z^2+36*X^3*Y^3*Z+26*X^2*Y^4*Z+30*X^2*Y^3*Z^2+6*X^2*Y*Z^4+26*X*Y^4*Z^2+36*X*Y^3*Z^3+36*X^3*Y^2*Z+12*X^2*Y^3*Z+211*X^2*Y^2*Z^2+138*X*Y^4*Z+12*X*Y^3*Z^2+36*X*Y^2*Z^3+30*X^3*Y*Z+32*X^2*Y^2*Z+18*X^2*Y*Z^2+56*X*Y^3*Z+32*X*Y^2*Z^2+30*X*Y*Z^3+10*X^2*Y*Z+146*X*Y^2*Z+10*X*Y*Z^2+30*X*Y*Z

Algorithm definition

The algorithm ⟨9×16×28:2394⟩ is the (Kronecker) tensor product of ⟨3×4×4:38⟩ with ⟨3×4×7:63⟩.

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