Finding complex-valued solutions of brent equations using nonlinear least squares
From MaRDI portal
Publication:6636622
DOI10.1134/S0965542524701021MaRDI QIDQ6636622FDOQ6636622
Authors: I. E. Kaporin 
Publication date: 12 November 2024
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
Cites Work
- Gaussian elimination is not optimal
- Minimization of functions having Lipschitz continuous first partial derivatives
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- The bilinear complexity and practical algorithms for matrix multiplication
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- How Can We Speed Up Matrix Multiplication?
- On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
- Matrix multiplication, a little faster
- Equivalent polyadic decompositions of matrix multiplication tensors
- Discovering faster matrix multiplication algorithms with reinforcement learning
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
- A Derivative-Free Nonlinear Least Squares Solver
- Minimization methods for approximating tensors and their comparison
Cited In (1)
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)
