A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
Preprint
Abstract
The quest for non-commutative matrix multiplication algorithms in small dimensions has seen a lot of recent improvements recently. In particular, the number of scalar multiplications required to multiply two~\(\matrixsize{4}{4}\) matrices was first reduced in~\cite{Fawzi:2022aa} from~\(49\) (two recursion levels of Strassen's algorithm) to~\(47\) but only in characteristic~\(2\) or more recently to~\(48\) in~\cite{alphaevolve} but over complex numbers.\par We propose an algorithm in~\(48\) multiplications with only rational coefficients, hence removing the complex number requirement. It was derived from the latter one, under the action of an isotropy which happen to project the algorithm on the field of rational numbers.We also produce a straight line program of this algorithm, reducing the leading constant in the complexity, as well as an alternative basis variant of it, leading to an algorithm running in~\({\frac{19}{16}n^{2+\frac{\log_2{3}}{2}} +o\!\left({n^{2+\frac{log_2{3}}{2}}}\right)}\) operations over any ring containing an inverse of~\(2\).
Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least SquaresComputational Mathematics and Mathematical Physics, 2024
- Strassen's algorithm is not optimally accurate2024
- Discovering faster matrix multiplication algorithms with reinforcement learningNature, 2022