On some computational orders of convergence
From MaRDI portal
Abstract: Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root.
The computational order of convergence has been used previously in the iterative methods for solving nonlinear equations. The authors introduce two variants of the order of convergence: the approximated computational order of convergence, and the extrapolated computational order of convergence. A new technique to update the number of significant digits in an adaptive multi-precision arithmetic and a new stopping criteria are given. Some numerical examples are provided to compare the different convergence criteria that produce the best approximations of the theoretical order of convergence of an iterative method.
Recommendations
- On new computational local orders of convergence
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- scientific article; zbMATH DE number 1424590
- A survey on the high convergence orders and computational convergence orders of sequences
- scientific article; zbMATH DE number 30307
Cites work
- A family of multi-point iterative methods for solving systems of nonlinear equations
- A method for obtaining iterative formulas of order three
- A simply constructed third-order modification of Newton's method
- A variant of Cauchy's method with accelerated fifth-order convergence.
- A variant of Chebyshev's method with sixth-order convergence
- A variant of Newton's method with accelerated third-order convergence
- Accelerated iterative methods for finding solutions of a system of nonlinear equations
- Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- An improvement of the Euler-Chebyshev iterative method
- Construction of Newton-like iteration methods for solving nonlinear equations
- Construction of third-order modifications of Newton's method
- Geometric mean Newton's method for simple and multiple roots
- Improvements of the efficiency of some three-step iterative like-Newton methods
- Iterative methods improving Newton's method by the decomposition method
- MPFR
- On some families of multi-point iterative methods for solving nonlinear equations
- On the construction of iterative methods with at least cubic convergence
- Some iterative methods for solving a system of nonlinear equations
- Some new variants of Newton's method.
- Some third-order families of iterative methods for solving nonlinear equations
- Third-order modification of Newton's method
- Variants of Newton's method using fifth-order quadrature formulas
Cited in
(61)- A new highly efficient and optimal family of eighth-order methods for solving nonlinear equations
- Local convergence of an optimal eighth order method under weak conditions
- A family of Newton type iterative methods for solving nonlinear equations
- Local convergence of an efficient high convergence order method using hypothesis only on the first derivative
- Local convergence of a Newton-Traub composition in Banach spaces
- Chebyshev-secant-type methods for non-differentiable operators
- A study on the local convergence and dynamics of the two-step and derivative-free Kung-Traub's method
- A survey on the high convergence orders and computational convergence orders of sequences
- An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
- A directly convergent numerical method based on orthoexponential polynomials for solving integro-differential-delay equations with variable coefficients and infinite boundary on half-line
- On the approximation of \(m\)th power divided differences preserving the local order of convergence
- Frozen iterative methods using divided differences ``à la Schmidt-Schwetlick
- Review of some iterative methods for solving nonlinear equations with multiple zeros
- Local convergence of a family of weighted-Newton methods
- An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics
- Maximum efficiency for a family of Newton-like methods with frozen derivatives and some applications
- On the efficiency of two variants of Kurchatov's method for solving nonlinear systems
- On convergence and efficiency in the resolution of systems of nonlinear equations from a local analysis
- scientific article; zbMATH DE number 6622835 (Why is no real title available?)
- Analysing the efficiency of some modifications of the secant method
- scientific article; zbMATH DE number 176380 (Why is no real title available?)
- A technique to choose the most efficient method between secant method and some variants
- Ostrowski type methods for solving systems of nonlinear equations
- The ``Gauss-Seidelization of iterative methods for solving nonlinear equations in the complex plane
- Design and analysis of a new class of derivative-free optimal order methods for nonlinear equations
- CONSTRUCTION OF DERIVATIVE-FREE ITERATIVE METHODS FROM CHEBYSHEV'S METHOD
- Efficient optimal families of higher-order iterative methods with local convergence
- How many steps still left to x?
- On the application of Euler's method to linear integro differential equations and comparison with existing methods
- An Optimal Reconstruction of Chebyshev–Halley-Type Methods with Local Convergence Analysis
- On the efficiency of a family of Steffensen-like methods with frozen divided differences
- scientific article; zbMATH DE number 7104068 (Why is no real title available?)
- A Traub type result for one-point iterative methods with memory
- A matrix-collocation method for solutions of singularly perturbed differential equations via Euler polynomials
- The limits of fixed-order computation
- Frozen divided difference scheme for solving systems of nonlinear equations
- Larger convergence regions for an efficient two-step iterative method
- A hybrid LRBF-DQ method for solving nonlinear (2 + 1) dimensional initial-boundary value problems
- Higher order Traub-Steffensen type methods and their convergence analysis in Banach spaces
- Two‐step iterative methods for multiple roots and their applications for solving several physical and chemical problems
- A highly efficient class of optimal fourth-order methods for solving nonlinear systems
- Enhancing the applicability of Chebyshev-like method
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- A fixed-point type result for some non-differentiable Fredholm integral equations
- Extended high convergence compositions for solving nonlinear equations in Banach space
- A Fibonacci Galerkin method for solving certain types of boundary value problems
- Families of high-order simultaneous methods with several corrections
- Global convergence of improved Chebyshev-secant type methods
- Convergence analysis of a power series based iterative method having seventh order of convergence
- Smoothing the absolute value equations by the component-wise analysis
- Some modifications and extensions of Popovski's and Laguerre's families for solving systems of nonlinear equations
- Semilocal convergence of secant-like methods for differentiable and nondifferentiable operator equations
- Semilocal and local convergence of multistep iterative compositions for nonlinear models
- On new computational local orders of convergence
- A conformable fractional iterative fixed-point method for solving one-dimensional nonlinear equations
- Enhanced stability and root detection in a derivative-free Steffensen algorithm for nonlinear dynamical systems
- Global convergence domains for nonlinear Hammerstein-type integral equations with non-separable kernels
- Derivative free iterative methods with memory having higher R-order of convergence
- Seventh-order derivative-free iterative method for solving nonlinear systems
- A family of iterative methods that uses divided differences of first and second orders
- On the semilocal convergence of Newton-Kantorovich method under center-Lipschitz conditions
This page was built for publication: On some computational orders of convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963840)
