Description of fast matrix multiplication algorithm: ⟨5×5×13:227⟩

Algorithm type

X3⁢Y2⁢Z3+5⁢X2⁢Y3⁢Z2+92⁢X2⁢Y2⁢Z2+X2⁢Y⁢Z2+2⁢X⁢Y3⁢Z+2⁢X⁢Y2⁢Z2+3⁢X⁢Y⁢Z3+40⁢X⁢Y2⁢Z+36⁢X⁢Y⁢Z2+45⁢X⁢Y⁢ZX3Y2Z35X2Y3Z292X2Y2Z2X2YZ22XY3Z2XY2Z23XYZ340XY2Z36XYZ245XYZX^3*Y^2*Z^3+5*X^2*Y^3*Z^2+92*X^2*Y^2*Z^2+X^2*Y*Z^2+2*X*Y^3*Z+2*X*Y^2*Z^2+3*X*Y*Z^3+40*X*Y^2*Z+36*X*Y*Z^2+45*X*Y*Z

Algorithm definition

The algorithm ⟨5×5×13:227⟩ 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