On Algorithms for Solvingf(x)=0
From MaRDI portal
Cites work
Cited in
(40)- Finding all periodic orbits of maps using Newton methods: Sizes of basins
- Further remarks on the global Newton method
- Newton and other continuation methods for multivalued inclusions
- Plane Autonomous Systems with Rational Vector Fields
- A vector regularization method to solve linear inverse problems
- On economic equilibrium type problems with applications
- A simple application of the homotopy method to symmetric eigenvalue problems
- A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations
- Newton vector fields on the plane and on the torus
- A global Newton method to compute Nash equilibria.
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
- Economic equilibrium problems in reflexive Banach spaces
- A lower bound for the topological complexity of poly(D,n)
- Newton's method and the computational complexity of the fundamental theorem of algebra
- On the role of singularities in Branin's method from dynamic and continuation perspectives.
- On the average number of steps of the simplex method of linear programming
- The Newton transform: An operational method for constructing integrals of dynamical systems
- Geometry of polynomials and root-finding via path-lifting
- On accelerating PL continuation algorithms by predictor—corrector methods
- On an application of dynamical systems theory to determine all the zeros of a vector function
- Complexity of an homotopy method at the neighbourhood of a zero
- Newton flows for elliptic functions: a pilot study†
- Newton Method and Trajectory-Based Method for Solving Power Flow Problems: Nonlinear Studies
- Artificial time integration
- Further results on global convergence and stability of globally projected dynamical systes
- The continuous, desingularized Newton method for meromorphic functions
- Optimal solution of nonlinear equations
- On the existence of generally convergent algorithms
- Global aspects of the continuous and discrete Newton method: A case study
- The theory of Newton's method
- On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations
- A computational method for finding all the roots of a vector function
- Intersecting families of sets and the topology of cones in economics
- Globally convergent, iterative path-following for algebraic equations
- Homotopy techniques in linear programming
- A simple and efficient method with high order convergence for solving systems of nonlinear equations
- Algebraic cycles from a computational point of view
- Finding a cluster of zeros of univariate polynomials
- On the use of the root locus of polynomials with complex coefficients for estimating the basin of attraction for the continuous-time Newton and Householder methods
- The fundamental theorem of algebra and complexity theory
This page was built for publication: On Algorithms for Solvingf(x)=0
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4195860)
