An improvement of the Euler-Chebyshev iterative method
From MaRDI portal
Publication:819019
DOI10.1016/J.JMAA.2005.09.086zbMATH Open1113.65048OpenAlexW2075466002MaRDI QIDQ819019FDOQ819019
Authors: Miquel Grau-Sánchez, José Luis Díaz-Barrero 
Publication date: 22 March 2006
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.09.086
Recommendations
numerical examplesiterative methodscomputational efficiencyNewton methodnonlinear equationorder of convergenceEuler-Chebyshev's formulaMaple algorithm
Complexity and performance of numerical algorithms (65Y20) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new iterative method for the computation of the solutions of nonlinear equations
- A variant of Cauchy's method with accelerated fifth-order convergence.
- P. L. Chebyshev (1821-1894). A guide to his life and work
- Title not available (Why is that?)
- Some efficient methods for enclosing simple zeros of nonlinear equations
Cited In (59)
- Improved two-step high order Euler-Chebyshev methods
- Title not available (Why is that?)
- An improved SCF iteration scheme
- On the semilocal convergence of damped Newton's method
- Some modifications of Newton's method with fifth-order convergence
- Improvements of the efficiency of some three-step iterative like-Newton methods
- Some sixth-order variants of Ostrowski root-finding methods
- A study on the local convergence and complex dynamics of Kou's family of iterative methods
- On the local convergence of a family of two-step iterative methods for solving nonlinear equations
- Note on a cubically convergent Newton-type method under weak conditions
- An improvement of Chebyshev-Halley methods free from second derivative
- Title not available (Why is that?)
- ON A CLASS OF EFFICIENT HIGHER ORDER NEWTON-LIKE METHODS
- Zero-finder methods derived from Obreshkov's techniques
- A family of second derivative free fourth order continuation method for solving nonlinear equations
- On some cubic convergence iterative formulae without derivatives for solving nonlinear equations
- Second derivative free sixth order continuation method for solving nonlinear equations with applications
- Zero-finder methods derived using Runge-Kutta techniques
- Some eighth-order root-finding three-step methods
- Some variants of Chebyshev-Halley methods with fifth-order convergence
- Some new sixth-order methods for solving non-linear equations
- On iterative methods with accelerated convergence for solving systems of nonlinear equations
- On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- Various Newton-type iterative methods for solving nonlinear equations
- Sixth order derivative free family of iterative methods
- An infinite family of one-step iterators for solving nonlinear equations to increase the order of convergence and a new algorithm of global convergence
- Some improvements of Jarratt's method with sixth-order convergence
- Adams-like techniques for zero-finder methods
- The Fibonacci family of iterative processes for solving nonlinear equations
- Some sixth order zero-finding variants of Chebyshev-Halley methods
- On new computational local orders of convergence
- Accelerated iterative methods for finding solutions of a system of nonlinear equations
- On Chebyshev‐type methods free from second derivative
- A family of fifth-order iterations composed of Newton and third-order methods
- A fifth-order iterative method for solving nonlinear equations
- A variant of Chebyshev's method with sixth-order convergence
- On computational efficiency for multi-precision zero-finding methods
- Modified Jarratt method with sixth-order convergence
- A Hummel \& Seebeck family of iterative methods with improved convergence and efficiency
- Some higher-order modifications of Newton's method for solving nonlinear equations
- On new third-order convergent iterative formulas
- An improvement to the computing of nonlinear equation solutions
- Modified Chebyshev-Halley methods with sixth-order convergence
- The improvements of Chebyshev-Halley methods with fifth-order convergence
- An improvement of the Jarratt method
- On Chebyshev-Halley methods with sixth-order convergence for solving non-linear equations
- Sixth-order variants of Chebyshev-Halley methods for solving non-linear equations
- Local convergence of a multi-step high order method with divided differences under hypotheses on the first derivative
- Improving order and efficiency: Composition with a modified Newton's method
- An optimization of Chebyshev's method
- Variants of a classic Traub's result
- Note on improvements of order and efficiency in some iterative methods for solving nonlinear equations
- Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
- Three novel fifth-order iterative schemes for solving nonlinear equations
- On some computational orders of convergence
- Extending the applicability of the super-Halley-like method using \(\omega\)-continuous derivatives and restricted convergence domains
- A variant of Jarratt method with sixth-order convergence
- A family of improved Jarratt multipoint methods
- Constructing third-order derivative-free iterative methods
Uses Software
This page was built for publication: An improvement of the Euler-Chebyshev iterative method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819019)
