Finding complex-valued solutions of brent equations using nonlinear least squares
type: Item
instance of: scholarly article
title: Finding complex-valued solutions of brent equations using nonlinear least squares
author: I. E. Kaporin
published in: Computational Mathematics and Mathematical Physics
publication date: 2024-11-12T00:00:00Z
Mathematics Subject Classification ID: 65F45
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 7942540
zbMATH Keywords: Brent equations
zbMATH Keywords: fast matrix multiplication
zbMATH Keywords: Strassen algorithm
zbMATH Keywords: nonlinear least squares problem
MaRDI profile type: Publication
cites work: Gaussian elimination is not optimal
cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
cites work: How Can We Speed Up Matrix Multiplication?
cites work: The bilinear complexity and practical algorithms for matrix multiplication
cites work: Matrix Multiplication, a Little Faster
cites work: A Derivative-Free Nonlinear Least Squares Solver
cites work: Minimization methods for approximating tensors and their comparison
cites work: On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
cites work: Equivalent polyadic decompositions of matrix multiplication tensors
cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
cites work: Discovering faster matrix multiplication algorithms with reinforcement learning
DOI: 10.1134/S0965542524701021
description: scientific article; zbMATH DE number 7942540