Cited in
(37)- Tensor-GMRES Method for Large Systems of Nonlinear Equations
- scientific article; zbMATH DE number 2000393 (Why is no real title available?)
- Recent advances in solvers for nonlinear algebraic equations
- Numerical solution of nonlinear equations in chemical speciation calculations
- A nonmonotone hybrid method for nonlinear systems∗
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
- Tensor methods for large sparse systems of nonlinear equations
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- On the Performance of Tensor Methods for Solving Ill-Conditioned Problems
- Tensor Methods for Equality Constrained Optimization
- Local convergence analysis of tensor methods for nonlinear equations
- Money non-neutrality in a rational belief equilibrium with financial assets
- Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods
- Curvilinear Linesearch for Tensor Methods
- Tensor-Krylov methods for large nonlinear equations
- On Nonlinear Iteration Methods for DC Analysis of Industrial Circuits
- STENMIN
- PITCON
- Algorithm 739
- Algorithm 848
- BEDFix
- Slatec
- COPRIN
- MPSalsa
- PHClab
- RALFit
- Tensor-Krylov Methods for Solving Large-Scale Systems of Nonlinear Equations
- scientific article; zbMATH DE number 1617973 (Why is no real title available?)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
- A quantitative metric for robustness of nonlinear algebraic equation solvers
- Circumscribed ellipsoid algorithm for fixed-point problems
- scientific article; zbMATH DE number 2086848 (Why is no real title available?)
- scientific article; zbMATH DE number 2072550 (Why is no real title available?)
- EFCOSS: an interactive environment facilitating optimal experimental design
- Tensor Methods for Large, Sparse Unconstrained Optimization
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
This page was built for software: TENSOLVE
