Algorithm 768: TENSOLVE
From MaRDI portal
Publication:4375497
DOI10.1145/264029.264032zbMath0887.65051OpenAlexW2068980859WikidataQ113310283 ScholiaQ113310283MaRDI QIDQ4375497
Robert B. Schnabel, Ali Bouaricha
Publication date: 8 February 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/
systems of nonlinear equationssoftware packagequadratic modeltensor methodstrust region approachline search approach
Numerical computation of solutions to systems of equations (65H10) Packaged methods for numerical algorithms (65Y15)
Related Items (9)
Tensor-Krylov methods for large nonlinear equations ⋮ Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems ⋮ Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems ⋮ A quantitative metric for robustness of nonlinear algebraic equation solvers ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ TENSOLVE ⋮ Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations ⋮ Tensor methods for large sparse systems of nonlinear equations ⋮ Local convergence analysis of tensor methods for nonlinear equations
Uses Software
This page was built for publication: Algorithm 768: TENSOLVE