A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
This paper presents a new state-of-the-art algorithm for exact 3times3 matrix multiplication over general non-commutative rings, achieving a rank-23 scheme with only 58 scalar additions. This improves the previous best additive complexity of 60 additions without a change of basis. The result was discovered through an automated search combining ternary-restricted flip-graph exploration with greedy intersection reduction for common subexpression elimination. The resulting scheme uses only coefficients from {-1, 0, 1}, ensuring both efficiency and portability across arbitrary fields. The total scalar operation count is reduced from 83 to 81.
69522805746a34b55dd548fd
A. I. Perminov
claimed_verified
2025-12-29T14:22:51.917Z
6447e4e6e214848834046f0f
https://cdn-avatars.huggingface.co/v1/production/uploads/6447e4e6e214848834046f0f/Vaxv_BuDaZRdR1MJ0IrLT.png
Perminov Andrew
dronperminov
user
dronperminov
A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
This paper presents a new state-of-the-art algorithm for exact 3times3 matrix multiplication over general non-commutative rings, achieving a rank-23 scheme with only 58 scalar additions. This improves the previous best additive complexity of 60 additions without a change of basis. The result was discovered through an automated search combining ternary-restricted flip-graph exploration with greedy intersection reduction for common subexpression elimination. The resulting scheme uses only coefficients from {-1, 0, 1}, ensuring both efficiency and portability across arbitrary fields. The total scalar operation count is reduced from 83 to 81.