Semi-analytical solution of Brent equations

DOI10.1134/s1064562424702223MaRDI QIDQ6644122

Igor E. Kaporin

Publication date: 27 November 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

fast matrix multiplicationStrassen algorithmBrent equations

Mathematics Subject Classification ID

Numerical interpolation (65D05) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65F99)

Cites Work

• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
• Equivalent polyadic decompositions of matrix multiplication tensors
• Gaussian elimination is not optimal
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• The bilinear complexity and practical algorithms for matrix multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Discovering faster matrix multiplication algorithms with reinforcement learning
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• A Derivative-Free Nonlinear Least Squares Solver

This page was built for publication: Semi-analytical solution of Brent equations