Geometry and convergence of some third-order methods
From MaRDI portal
Two iterative third-order methods are introduced for the problem of finding the zeros of a function. Sufficient conditions are developed for their convergence. The main idea is to use an interpolation by an exponential and a logarithmic function. The proposed methods are compared with the classical ones, from an analytical and a numerical point of view.
Recommendations
- Several new third-order iterative methods for solving nonlinear equations
- Some new iterative methods with three-order convergence
- On new third-order convergent iterative formulas
- A geometric construction of iterative formulas of order three
- A geometric construction of iterative functions of order three to solve nonlinear equations
Cited in
(14)- Toward a unified theory for third \(R\)-order iterative methods for operators with unbounded second derivative
- On some one-point hybrid iterative methods
- Comparison theorems for a third order method
- On a higher order secant method.
- Solving symmetric algebraic Riccati equations with high order iterative schemes
- Newton-type methods of high order and domains of semilocal and global convergence
- Dynamics of a higher-order family of iterative methods
- Third-order iterative methods under Kantorovich conditions
- A qualitative analysis of a family of Newton-like iterative process with R-order of convergence at least three
- A third-order iterative algorithm for inversion of cumulative central beta distribution
- Third Order Root-Finding Methods based on a Generalization of Gander's Result
- Enhancing the applicability of Chebyshev-like method
- Solving nonlinear integral equations of Fredholm type with high order iterative methods
- A geometric construction of iterative formulas of order three
This page was built for publication: Geometry and convergence of some third-order methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2782159)
