On some computational orders of convergence
From MaRDI portal
Publication:963840
DOI10.1016/J.AML.2009.12.006zbMATH Open1189.65092arXiv1202.4236OpenAlexW2062250587MaRDI QIDQ963840FDOQ963840
Authors: Miquel Grau-Sánchez, Miquel Noguera, José Manuel Gutiérrez Jimenez 
Publication date: 14 April 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1202.4236
Recommendations
- On new computational local orders of convergence
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- Publication:4945842
- A survey on the high convergence orders and computational convergence orders of sequences
- scientific article; zbMATH DE number 30307
Cites Work
- Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- Variants of Newton's method using fifth-order quadrature formulas
- Accelerated iterative methods for finding solutions of a system of nonlinear equations
- MPFR
- Some new variants of Newton's method.
- Some iterative methods for solving a system of nonlinear equations
- A variant of Newton's method with accelerated third-order convergence
- An improvement of the Euler-Chebyshev iterative method
- Some third-order families of iterative methods for solving nonlinear equations
- A variant of Cauchy's method with accelerated fifth-order convergence.
- Third-order modification of Newton's method
- Construction of third-order modifications of Newton's method
- A variant of Chebyshev's method with sixth-order convergence
- Construction of Newton-like iteration methods for solving nonlinear equations
- A simply constructed third-order modification of Newton's method
- Geometric mean Newton's method for simple and multiple roots
- On some families of multi-point iterative methods for solving nonlinear equations
- A method for obtaining iterative formulas of order three
- Iterative methods improving Newton's method by the decomposition method
- A family of multi-point iterative methods for solving systems of nonlinear equations
- On the construction of iterative methods with at least cubic convergence
- Improvements of the efficiency of some three-step iterative like-Newton methods
Cited In (54)
- 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
- An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
- Two‐step iterative methods for multiple roots and their applications for solving several physical and chemical problems
- A hybrid LRBF-DQ method for solving nonlinear (2 + 1) dimensional initial-boundary value problems
- A study on the local convergence and dynamics of the two-step and derivative-free Kung-Traub's method
- A directly convergent numerical method based on orthoexponential polynomials for solving integro-differential-delay equations with variable coefficients and infinite boundary on half-line
- A matrix-collocation method for solutions of singularly perturbed differential equations via Euler polynomials
- A technique to choose the most efficient method between secant method and some variants
- Frozen iterative methods using divided differences ``à la Schmidt-Schwetlick
- A family of Newton type iterative methods for solving nonlinear equations
- Local convergence of a family of weighted-Newton methods
- The limits of fixed-order computation
- Title not available (Why is that?)
- Frozen divided difference scheme for solving systems of nonlinear equations
- Local convergence of an efficient high convergence order method using hypothesis only on the first derivative
- On convergence and efficiency in the resolution of systems of nonlinear equations from a local analysis
- Seventh-order derivative-free iterative method for solving nonlinear systems
- Design and analysis of a new class of derivative-free optimal order methods for nonlinear equations
- An Optimal Reconstruction of Chebyshev–Halley-Type Methods with Local Convergence Analysis
- Local convergence of a Newton-Traub composition in Banach spaces
- A Traub type result for one-point iterative methods with memory
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- Ostrowski type methods for solving systems of nonlinear equations
- CONSTRUCTION OF DERIVATIVE-FREE ITERATIVE METHODS FROM CHEBYSHEV'S METHOD
- On the approximation of \(m\)th power divided differences preserving the local order of convergence
- How many steps still left to \(x\)?
- On the semilocal convergence of Newton-Kantorovich method under center-Lipschitz conditions
- A family of iterative methods that uses divided differences of first and second orders
- Local convergence of an optimal eighth order method under weak conditions
- The ``Gauss-Seidelization of iterative methods for solving nonlinear equations in the complex plane
- On the efficiency of two variants of Kurchatov's method for solving nonlinear systems
- Title not available (Why is that?)
- On new computational local orders of convergence
- A highly efficient class of optimal fourth-order methods for solving nonlinear systems
- Maximum efficiency for a family of Newton-like methods with frozen derivatives and some applications
- On the application of Euler's method to linear integro differential equations and comparison with existing methods
- Title not available (Why is that?)
- Review of some iterative methods for solving nonlinear equations with multiple zeros
- Efficient optimal families of higher-order iterative methods with local convergence
- A new highly efficient and optimal family of eighth-order methods for solving nonlinear equations
- Derivative free iterative methods with memory having higher R-order of convergence
- Analysing the efficiency of some modifications of the secant method
- A survey on the high convergence orders and computational convergence orders of sequences
- Chebyshev-secant-type methods for non-differentiable operators
- Higher order Traub-Steffensen type methods and their convergence analysis in Banach spaces
- Enhancing the applicability of Chebyshev-like method
- An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics
- Semilocal convergence of secant-like methods for differentiable and nondifferentiable operator equations
- On the efficiency of a family of Steffensen-like methods with frozen divided differences
- Larger convergence regions for an efficient two-step iterative method
Uses Software
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)
