On Algorithms for Solvingf(x)=0
From MaRDI portal
Publication:4195860
DOI10.1002/cpa.3160320302zbMath0408.65032OpenAlexW1515849990MaRDI QIDQ4195860
Morris W. Hirsch, Stephen Smale
Publication date: 1979
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpa.3160320302
AlgorithmNewton's MethodNumerical MethodsGlobal Numerical MethodsNonlinear Equations in Rn-SpacePolynomial EquationsDifferential TopologyHomotopy MethodsConstructing Starting Values
Related Items
Further results on global convergence and stability of globally projected dynamical systes, On the existence of generally convergent algorithms, Optimal solution of nonlinear equations, Homotopy techniques in linear programming, Intersecting families of sets and the topology of cones in economics, Plane Autonomous Systems with Rational Vector Fields, Newton and other continuation methods for multivalued inclusions, Economic equilibrium problems in reflexive Banach spaces, A vector regularization method to solve linear inverse problems, Global aspects of the continuous and discrete Newton method: A case study, A lower bound for the topological complexity of poly(D,n), Artificial time integration, A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions, On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations, A global Newton method to compute Nash equilibria., Further remarks on the global Newton method, Geometry of polynomials and root-finding via path-lifting, The continuous, desingularized Newton method for meromorphic functions, On economic equilibrium type problems with applications, A computational method for finding all the roots of a vector function, Finding all periodic orbits of maps using Newton methods: Sizes of basins, Globally convergent, iterative path-following for algebraic equations, Algebraic cycles from a computational point of view, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, A simple and efficient method with high order convergence for solving systems of nonlinear equations, A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations, On the average number of steps of the simplex method of linear programming, Newton flows for elliptic functions: a pilot study†, The Newton transform: An operational method for constructing integrals of dynamical systems, Newton vector fields on the plane and on the torus, On an application of dynamical systems theory to determine all the zeros of a vector function, The fundamental theorem of algebra and complexity theory, Complexity of an Homotopy Method at the Neighbourhood of a Zero, Newton Method and Trajectory-Based Method for Solving Power Flow Problems: Nonlinear Studies, On accelerating PL continuation algorithms by predictor—corrector methods, A simple application of the homotopy method to symmetric eigenvalue problems, The theory of Newton's method, Finding a cluster of zeros of univariate polynomials, On the role of singularities in Branin's method from dynamic and continuation perspectives.
Cites Work
