Semi-Analytical Solution of Brent Equations
Author:
- 1 August 2024
- journal article
- research article
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 110 (1) , 318-322
Abstract
A parametrization of Brent equations is proposed which leads to a several times reduction of the number of unknowns and equations. The arising equations are solved numerically using a nonlinear least squares method. Matrix multiplication algorithms that are faster than previously known ones are obtained. In particular, \((4,4,4;48)\)- and \((2,4,5;32)\)-algorithms are found.
Keywords
This publication has 10 references indexed in Scilit:
- Deflation conjecture and local dimensions of Brent equationsarXiv, 2023
- Discovering faster matrix multiplication algorithms with reinforcement learningNature, 2022
- Equivalent polyadic decompositions of matrix multiplication tensorsJournal of Computational and Applied Mathematics, 2022
- Accelerating Neural Network Training using Arbitrary Precision Approximating Matrix Multiplication Algorithms2021
- Optimization and Applications2021
- The geometry of rank decompositions of matrix multiplication II: 3 × 3 matricesJournal of Pure and Applied Algebra, 2019
- The bilinear complexity and practical algorithms for matrix multiplicationComputational Mathematics and Mathematical Physics, 2013
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplicationsBulletin of the American Mathematical Society, 1976
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969