Description of fast matrix multiplication algorithm: ⟨16×16×30:4325⟩

Algorithm type

6⁢X3⁢Y5⁢Z5+15⁢X3⁢Y4⁢Z6+450⁢X4⁢Y4⁢Z4+4⁢X3⁢Y4⁢Z5+5⁢X3⁢Y4⁢Z4+6⁢X2⁢Y5⁢Z4+90⁢X6⁢Y2⁢Z2+90⁢X4⁢Y4⁢Z2+90⁢X4⁢Y2⁢Z4+135⁢X2⁢Y6⁢Z2+37⁢X2⁢Y4⁢Z4+135⁢X2⁢Y2⁢Z6+40⁢X2⁢Y4⁢Z3+49⁢X2⁢Y3⁢Z4+4⁢X⁢Y2⁢Z6+495⁢X4⁢Y2⁢Z2+275⁢X2⁢Y4⁢Z2+41⁢X2⁢Y3⁢Z3+266⁢X2⁢Y2⁢Z4+60⁢X⁢Y6⁢Z+16⁢X⁢Y5⁢Z2+71⁢X⁢Y⁢Z6+40⁢X2⁢Y4⁢Z+29⁢X2⁢Y3⁢Z2+17⁢X2⁢Y2⁢Z3+40⁢X2⁢Y⁢Z4+2⁢X⁢Y5⁢Z+10⁢X⁢Y4⁢Z2+40⁢X3⁢Y2⁢Z+40⁢X3⁢Y⁢Z2+230⁢X2⁢Y2⁢Z2+31⁢X⁢Y4⁢Z+90⁢X⁢Y3⁢Z2+60⁢X⁢Y2⁢Z3+20⁢X⁢Y⁢Z4+220⁢X2⁢Y2⁢Z+220⁢X2⁢Y⁢Z2+11⁢X⁢Y3⁢Z+334⁢X⁢Y2⁢Z2+230⁢X⁢Y2⁢Z+244⁢X⁢Y⁢Z2+37⁢X⁢Y⁢Z6X3Y5Z515X3Y4Z6450X4Y4Z44X3Y4Z55X3Y4Z46X2Y5Z490X6Y2Z290X4Y4Z290X4Y2Z4135X2Y6Z237X2Y4Z4135X2Y2Z640X2Y4Z349X2Y3Z44XY2Z6495X4Y2Z2275X2Y4Z241X2Y3Z3266X2Y2Z460XY6Z16XY5Z271XYZ640X2Y4Z29X2Y3Z217X2Y2Z340X2YZ42XY5Z10XY4Z240X3Y2Z40X3YZ2230X2Y2Z231XY4Z90XY3Z260XY2Z320XYZ4220X2Y2Z220X2YZ211XY3Z334XY2Z2230XY2Z244XYZ237XYZ6*X^3*Y^5*Z^5+15*X^3*Y^4*Z^6+450*X^4*Y^4*Z^4+4*X^3*Y^4*Z^5+5*X^3*Y^4*Z^4+6*X^2*Y^5*Z^4+90*X^6*Y^2*Z^2+90*X^4*Y^4*Z^2+90*X^4*Y^2*Z^4+135*X^2*Y^6*Z^2+37*X^2*Y^4*Z^4+135*X^2*Y^2*Z^6+40*X^2*Y^4*Z^3+49*X^2*Y^3*Z^4+4*X*Y^2*Z^6+495*X^4*Y^2*Z^2+275*X^2*Y^4*Z^2+41*X^2*Y^3*Z^3+266*X^2*Y^2*Z^4+60*X*Y^6*Z+16*X*Y^5*Z^2+71*X*Y*Z^6+40*X^2*Y^4*Z+29*X^2*Y^3*Z^2+17*X^2*Y^2*Z^3+40*X^2*Y*Z^4+2*X*Y^5*Z+10*X*Y^4*Z^2+40*X^3*Y^2*Z+40*X^3*Y*Z^2+230*X^2*Y^2*Z^2+31*X*Y^4*Z+90*X*Y^3*Z^2+60*X*Y^2*Z^3+20*X*Y*Z^4+220*X^2*Y^2*Z+220*X^2*Y*Z^2+11*X*Y^3*Z+334*X*Y^2*Z^2+230*X*Y^2*Z+244*X*Y*Z^2+37*X*Y*Z

Algorithm definition

The algorithm ⟨16×16×30:4325⟩ is serendipitous tensor product (⟨4×4×10:115⟩ - 30) ⊗ ⟨4×4×3:38⟩ +15⟨4×4×6:73⟩.

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