Description of fast matrix multiplication algorithm: ⟨7×15×16:1083⟩

Algorithm type

40X4Y8Z4+16X2Y12Z2+16X3Y8Z3+16XY12Z+4X4Y4Z5+20X2Y8Z3+8X6Y4Z2+4X4Y4Z4+4X3Y4Z5+52X2Y8Z2+8X2Y4Z6+16X5Y4Z2+4X3Y4Z4+4X2Y8Z+2X2Y6Z3+16XY8Z2+2X5Y2Z3+11X3Y4Z3+X2Y6Z2+42X2Y4Z4+5X2Y2Z6+12XY8Z+XY6Z3+4X5Y2Z2+2X4Y2Z3+3X3Y4Z2+3X2Y6Z+19X2Y4Z3+19X2Y2Z5+7XY6Z2+2X5Y2Z+3X4Y2Z2+21X3Y4Z+3X3Y2Z3+21X2Y4Z2+20X2Y2Z4+2XY6Z+15XY4Z3+6XYZ6+X4Y2Z+9X3Y2Z2+8X3YZ3+6X2Y4Z+30X2Y2Z3+36XY4Z2+7XY3Z3+6XY2Z4+2XYZ5+3X3Y2Z+2X3YZ2+115X2Y2Z2+16X2YZ3+15XY4Z+29XY2Z3+8XYZ4+46X3YZ+15X2Y2Z+3X2YZ2+53XY3Z+58XY2Z2+52XYZ3+13X2YZ+36XY2Z+46XYZ2+14XYZ40X4Y8Z416X2Y12Z216X3Y8Z316XY12Z4X4Y4Z520X2Y8Z38X6Y4Z24X4Y4Z44X3Y4Z552X2Y8Z28X2Y4Z616X5Y4Z24X3Y4Z44X2Y8Z2X2Y6Z316XY8Z22X5Y2Z311X3Y4Z3X2Y6Z242X2Y4Z45X2Y2Z612XY8ZXY6Z34X5Y2Z22X4Y2Z33X3Y4Z23X2Y6Z19X2Y4Z319X2Y2Z57XY6Z22X5Y2Z3X4Y2Z221X3Y4Z3X3Y2Z321X2Y4Z220X2Y2Z42XY6Z15XY4Z36XYZ6X4Y2Z9X3Y2Z28X3YZ36X2Y4Z30X2Y2Z336XY4Z27XY3Z36XY2Z42XYZ53X3Y2Z2X3YZ2115X2Y2Z216X2YZ315XY4Z29XY2Z38XYZ446X3YZ15X2Y2Z3X2YZ253XY3Z58XY2Z252XYZ313X2YZ36XY2Z46XYZ214XYZ40*X^4*Y^8*Z^4+16*X^2*Y^12*Z^2+16*X^3*Y^8*Z^3+16*X*Y^12*Z+4*X^4*Y^4*Z^5+20*X^2*Y^8*Z^3+8*X^6*Y^4*Z^2+4*X^4*Y^4*Z^4+4*X^3*Y^4*Z^5+52*X^2*Y^8*Z^2+8*X^2*Y^4*Z^6+16*X^5*Y^4*Z^2+4*X^3*Y^4*Z^4+4*X^2*Y^8*Z+2*X^2*Y^6*Z^3+16*X*Y^8*Z^2+2*X^5*Y^2*Z^3+11*X^3*Y^4*Z^3+X^2*Y^6*Z^2+42*X^2*Y^4*Z^4+5*X^2*Y^2*Z^6+12*X*Y^8*Z+X*Y^6*Z^3+4*X^5*Y^2*Z^2+2*X^4*Y^2*Z^3+3*X^3*Y^4*Z^2+3*X^2*Y^6*Z+19*X^2*Y^4*Z^3+19*X^2*Y^2*Z^5+7*X*Y^6*Z^2+2*X^5*Y^2*Z+3*X^4*Y^2*Z^2+21*X^3*Y^4*Z+3*X^3*Y^2*Z^3+21*X^2*Y^4*Z^2+20*X^2*Y^2*Z^4+2*X*Y^6*Z+15*X*Y^4*Z^3+6*X*Y*Z^6+X^4*Y^2*Z+9*X^3*Y^2*Z^2+8*X^3*Y*Z^3+6*X^2*Y^4*Z+30*X^2*Y^2*Z^3+36*X*Y^4*Z^2+7*X*Y^3*Z^3+6*X*Y^2*Z^4+2*X*Y*Z^5+3*X^3*Y^2*Z+2*X^3*Y*Z^2+115*X^2*Y^2*Z^2+16*X^2*Y*Z^3+15*X*Y^4*Z+29*X*Y^2*Z^3+8*X*Y*Z^4+46*X^3*Y*Z+15*X^2*Y^2*Z+3*X^2*Y*Z^2+53*X*Y^3*Z+58*X*Y^2*Z^2+52*X*Y*Z^3+13*X^2*Y*Z+36*X*Y^2*Z+46*X*Y*Z^2+14*X*Y*Z

Algorithm definition

The algorithm ⟨7×15×16:1083⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

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