Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
Sufficient conditions under which the Euler and Halley methods are globally and monotonically convergent to a root of an equation \(f(x)= 0\) are well known. They are, however, included as special cases in the theory of more general iteration functions. As is obvious, several higher-order methods can possess no common geometrical interpretation. In order to exploit such an interpretation, the author considers each of these two methods separately. While the approximation function in the Euler method is a parabola that in the Halley method is a hyperbola. Based on these approximation functions the proofs of the corresponding two theorems become rather simple and illustrative. Although not similar they are analogous to each other, however. The author then considers some results made possible by the geometric interpretation. Among other things it is possible to compare both methods and identify situation where one is preferable to the other. Finally, a generalization containing both these methods is outlined.
- Zero-finder methods derived from Obreshkov's techniques
- Semilocal convergence for Halley's method under weak Lipschitz condition
- Geometric constructions of iterative functions to solve nonlinear equations
- A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
- A globally convergent method for finding zeros of smooth functions
- A general approach to the study of the convergence of Picard iteration with an application to Halley's method for multiple zeros of analytic functions
- A new class of Halley's method with third-order convergence for solving nonlinear equations
- Some variants of Halley's method with memory and their applications for solving several chemical problems
- Convergence analysis on a second order algorithm for orthogonal projection onto curves
- Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
- Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space
- Super-attracting periodic orbits for a classical third order method
- Fifth-order iterative methods for solving nonlinear equations
- Predictor-corrector Halley method for nonlinear equations
- A one-parameter family of third-order methods to solve nonlinear equations
- A new modified Halley method without second derivatives for nonlinear equation
- A note on fifth-order iterative methods for solving nonlinear equations
- Newton-type methods of high order and domains of semilocal and global convergence
- Global convergence and the Powell singular function
- A new modified King-Werner method for solving nonlinear equations
- On a family of Halley-like methods to find simple roots of nonlinear equations
- On the efficiency index of one-point iterative processes
- A modification of Cauchy's method for quadratic equations
- Some variants of Cauchy's method with accelerated fourth-order convergence
- Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations
- On the dynamics of the Euler iterative function
- On method of osculating circle for solving nonlinear equations
- Semilocal convergence for a family of Chebyshev-Halley like iterations under a mild differentiability condition
- The construction of rational iterative methods for solving nonlinear equations
- Third-order iterative methods under Kantorovich conditions
- On widening region of convergence for newton' method - a numerical ODE perspective
- The Schwarzian-Newton method for solving nonlinear equations, with applications
- Exponentially fitted variants of Newton's method with quadratic and cubic convergence
- High-order parameter approximation for von Mises-Fisher distributions
- After notes on Chebyshev's iterative method
- On the Geometry of Halley's Method
- On generalized Halley-like methods for solving nonlinear equations
- A ninth-order iterative method for nonlinear equations along with polynomiography
- A third-order iterative algorithm for inversion of cumulative central beta distribution
- Implicit and explicit discrete‐time realizations of homogeneous differentiators
- Third Order Root-Finding Methods based on a Generalization of Gander's Result
- New modification methods for finding zeros of nonlinear functions
- A new three- step derivative free iterative method and its dynamics
- Third-order Halley-type iterative method with positive and bounded correction function
- Dynamics of a new family of iterative processes for quadratic polynomials
- Application of iterative processes of \(R\)-order at least three to operators with unbounded second derivative
- A family of third-order methods to solve nonlinear equations by quadratic curves approximation
- On the global convergence of Chebyshev's iterative method
- Modified families of Newton, Halley and Chebyshev methods
- Some iterative methods free from second derivatives for nonlinear equations
- Methods with prefixed order for approximating square roots with global and general convergence
This page was built for publication: Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376474)
