Description of fast matrix multiplication algorithm: ⟨11×11×15:1169⟩

Algorithm type

X8Y8Z8+X7Y7Z8+X7Y7Z6+2X6Y7Z7+X4Y11Z4+X10Y4Z4+2X6Y6Z6+X4Y4Z10+X3Y7Z7+X3Y3Z11+X4Y8Z4+X3Y10Z3+2X4Y4Z7+X3Y6Z6+X4Y7Z3+X3Y3Z7+22X4Y4Z4+2X3Y6Z3+3X4Y4Z3+5X4Y3Z4+2X3Y4Z4+X3Y2Z6+4X6Y2Z2+3X4Y4Z2+5X4Y3Z3+2X4Y2Z4+5X3Y4Z3+5X3Y3Z4+6X2Y6Z2+7X2Y4Z4+6X2Y2Z6+2X5Y2Z2+2X2Y6Z+3X2Y5Z2+2X2Y4Z3+2X2Y3Z4+3X2Y2Z5+2X2YZ6+XY6Z2+2XY4Z4+XY2Z6+X4Y2Z2+15X2Y4Z2+X2Y3Z3+15X2Y2Z4+XY5Z2+XY4Z3+XY3Z4+XY2Z5+4X2Y4Z+4X2Y3Z2+6X2Y2Z3+2X2YZ4+2XY4Z2+2XY2Z4+X2Y3Z+389X2Y2Z2+X2YZ3+XY4Z+XY3Z2+XY2Z3+XYZ4+7X3YZ+5X2Y2Z+5X2YZ2+12XY3Z+12XY2Z2+12XYZ3+64X2YZ+123XY2Z+119XYZ2+242XYZX8Y8Z8X7Y7Z8X7Y7Z62X6Y7Z7X4Y11Z4X10Y4Z42X6Y6Z6X4Y4Z10X3Y7Z7X3Y3Z11X4Y8Z4X3Y10Z32X4Y4Z7X3Y6Z6X4Y7Z3X3Y3Z722X4Y4Z42X3Y6Z33X4Y4Z35X4Y3Z42X3Y4Z4X3Y2Z64X6Y2Z23X4Y4Z25X4Y3Z32X4Y2Z45X3Y4Z35X3Y3Z46X2Y6Z27X2Y4Z46X2Y2Z62X5Y2Z22X2Y6Z3X2Y5Z22X2Y4Z32X2Y3Z43X2Y2Z52X2YZ6XY6Z22XY4Z4XY2Z6X4Y2Z215X2Y4Z2X2Y3Z315X2Y2Z4XY5Z2XY4Z3XY3Z4XY2Z54X2Y4Z4X2Y3Z26X2Y2Z32X2YZ42XY4Z22XY2Z4X2Y3Z389X2Y2Z2X2YZ3XY4ZXY3Z2XY2Z3XYZ47X3YZ5X2Y2Z5X2YZ212XY3Z12XY2Z212XYZ364X2YZ123XY2Z119XYZ2242XYZX^8*Y^8*Z^8+X^7*Y^7*Z^8+X^7*Y^7*Z^6+2*X^6*Y^7*Z^7+X^4*Y^11*Z^4+X^10*Y^4*Z^4+2*X^6*Y^6*Z^6+X^4*Y^4*Z^10+X^3*Y^7*Z^7+X^3*Y^3*Z^11+X^4*Y^8*Z^4+X^3*Y^10*Z^3+2*X^4*Y^4*Z^7+X^3*Y^6*Z^6+X^4*Y^7*Z^3+X^3*Y^3*Z^7+22*X^4*Y^4*Z^4+2*X^3*Y^6*Z^3+3*X^4*Y^4*Z^3+5*X^4*Y^3*Z^4+2*X^3*Y^4*Z^4+X^3*Y^2*Z^6+4*X^6*Y^2*Z^2+3*X^4*Y^4*Z^2+5*X^4*Y^3*Z^3+2*X^4*Y^2*Z^4+5*X^3*Y^4*Z^3+5*X^3*Y^3*Z^4+6*X^2*Y^6*Z^2+7*X^2*Y^4*Z^4+6*X^2*Y^2*Z^6+2*X^5*Y^2*Z^2+2*X^2*Y^6*Z+3*X^2*Y^5*Z^2+2*X^2*Y^4*Z^3+2*X^2*Y^3*Z^4+3*X^2*Y^2*Z^5+2*X^2*Y*Z^6+X*Y^6*Z^2+2*X*Y^4*Z^4+X*Y^2*Z^6+X^4*Y^2*Z^2+15*X^2*Y^4*Z^2+X^2*Y^3*Z^3+15*X^2*Y^2*Z^4+X*Y^5*Z^2+X*Y^4*Z^3+X*Y^3*Z^4+X*Y^2*Z^5+4*X^2*Y^4*Z+4*X^2*Y^3*Z^2+6*X^2*Y^2*Z^3+2*X^2*Y*Z^4+2*X*Y^4*Z^2+2*X*Y^2*Z^4+X^2*Y^3*Z+389*X^2*Y^2*Z^2+X^2*Y*Z^3+X*Y^4*Z+X*Y^3*Z^2+X*Y^2*Z^3+X*Y*Z^4+7*X^3*Y*Z+5*X^2*Y^2*Z+5*X^2*Y*Z^2+12*X*Y^3*Z+12*X*Y^2*Z^2+12*X*Y*Z^3+64*X^2*Y*Z+123*X*Y^2*Z+119*X*Y*Z^2+242*X*Y*Z

Algorithm definition

The algorithm ⟨11×11×15:1169⟩ 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