Description of fast matrix multiplication algorithm: ⟨9×15×15:1236⟩

Algorithm type

96X6Y9Z4+48X6Y8Z2+32X6Y6Z4+96X6Y7Z2+48X3Y9Z2+8X6Y5Z2+8X5Y6Z2+4X3Y9Z+32X5Y5Z2+4X4Y4Z4+52X3Y8Z+16X3Y7Z+112X3Y6Z2+16X3Y6Z+12X2Y6Z2+104X3Y5Z+2X4Y2Z2+48X3Y4Z+96X3Y3Z2+11X2Y4Z2+27X2Y2Z4+9XY6Z+144X3Y3Z+6X2Y3Z+11X2Y2Z2+6XY4Z+9XY3Z2+18XYZ4+4X2Y2Z+12X2YZ2+33XY3Z+24XY2Z2+22XY2Z+66XYZ296X6Y9Z448X6Y8Z232X6Y6Z496X6Y7Z248X3Y9Z28X6Y5Z28X5Y6Z24X3Y9Z32X5Y5Z24X4Y4Z452X3Y8Z16X3Y7Z112X3Y6Z216X3Y6Z12X2Y6Z2104X3Y5Z2X4Y2Z248X3Y4Z96X3Y3Z211X2Y4Z227X2Y2Z49XY6Z144X3Y3Z6X2Y3Z11X2Y2Z26XY4Z9XY3Z218XYZ44X2Y2Z12X2YZ233XY3Z24XY2Z222XY2Z66XYZ296*X^6*Y^9*Z^4+48*X^6*Y^8*Z^2+32*X^6*Y^6*Z^4+96*X^6*Y^7*Z^2+48*X^3*Y^9*Z^2+8*X^6*Y^5*Z^2+8*X^5*Y^6*Z^2+4*X^3*Y^9*Z+32*X^5*Y^5*Z^2+4*X^4*Y^4*Z^4+52*X^3*Y^8*Z+16*X^3*Y^7*Z+112*X^3*Y^6*Z^2+16*X^3*Y^6*Z+12*X^2*Y^6*Z^2+104*X^3*Y^5*Z+2*X^4*Y^2*Z^2+48*X^3*Y^4*Z+96*X^3*Y^3*Z^2+11*X^2*Y^4*Z^2+27*X^2*Y^2*Z^4+9*X*Y^6*Z+144*X^3*Y^3*Z+6*X^2*Y^3*Z+11*X^2*Y^2*Z^2+6*X*Y^4*Z+9*X*Y^3*Z^2+18*X*Y*Z^4+4*X^2*Y^2*Z+12*X^2*Y*Z^2+33*X*Y^3*Z+24*X*Y^2*Z^2+22*X*Y^2*Z+66*X*Y*Z^2

Algorithm definition

The algorithm ⟨9×15×15:1236⟩ 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