A globally convergent method for finding zeros of smooth functions
From MaRDI portal
Publication:1855886
DOI10.1016/S0096-3003(01)00244-2zbMath1027.65067MaRDI QIDQ1855886
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Uses Software
Cites Work
- A transformation to avoid solutions at infinity for polynomial systems
- On a theorem of S. Smale about Newton's method for analytic mappings
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- A Method for Computing All Solutions to Systems of Polynomials Equations
- Finding All Solutions to a System of Polynomial Equations
- An Approach to Homotopy and Degree Theory
- Computational experience with the Chow—Yorke algorithm
- Thomas Simpson and ‘Newton's method of approximation’: an enduring myth
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Algorithm 777: HOMPACK90
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
- Historical Development of the Newton–Raphson Method
- A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item