Finding complex-valued solutions of brent equations using nonlinear least squares
From MaRDI portal
(Redirected from Publication:6636622)
Recommendations
Cites work
- A Derivative-Free Nonlinear Least Squares Solver
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Equivalent polyadic decompositions of matrix multiplication tensors
- Gaussian elimination is not optimal
- How Can We Speed Up Matrix Multiplication?
- Matrix multiplication, a little faster
- Minimization methods for approximating tensors and their comparison
- Minimization of functions having Lipschitz continuous first partial derivatives
- On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
This page was built for publication: Finding complex-valued solutions of brent equations using nonlinear least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636622)