Complexity of an Homotopy Method at the Neighbourhood of a Zero
From MaRDI portal
Publication:2832953
DOI10.1007/978-3-319-39228-8_7zbMath1406.65041OpenAlexW2525800511MaRDI QIDQ2832953
Jean-Claude Yakoubsohn, José Manuel Gutiérrez Jimenez, Ángel Alberto Magreñán
Publication date: 15 November 2016
Published in: SEMA SIMAI Springer Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39228-8_7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Historical developments in convergence analysis for Newton's and Newton-like methods
- The theory of Newton's method
- Certified Numerical Homotopy Tracking
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- The fundamental theorem of algebra and complexity theory
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Convergence and Complexity of Newton Iteration for Operator Equations
- On Algorithms for Solvingf(x)=0
- Convergence of Newton’s method and inverse function theorem in Banach space
- Historical Development of the Newton–Raphson Method
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- Convergence of Newton's method and uniqueness of the solution of equations in Banach space
- On Solving Nonlinear Equations with a One-Parameter Operator Imbedding
- Dynamics in One Complex Variable. (AM-160)
- The continuation method for functional equations
