scholarly journals After notes on Chebyshev’s iterative method

2017 ◽  
Vol 2 (1) ◽  
pp. 1-12 ◽  
Author(s):  
S. Amat ◽  
S. Busquier

AbstractThis paper is a small review of Chebyshev’s method. The geometric interpretation as a generalization of Newton’s method is derived. Using this interpretation its global convergence is proved. Some dynamical properties are studied. As a higher order method, they are more complicated than in Newton’s method. Finally, some applications are revisited pointing out the advantages of Chebyshev’s method with respect Newton’s method.

2015 ◽  
Vol 34 (2) ◽  
pp. 197-211
Author(s):  
D. Sbibih ◽  
Abdelhafid Serghini ◽  
A. Tijini ◽  
A. Zidna

In this paper, we describe an iterative method for approximating asimple zero $z$ of a real defined function. This method is aessentially based on the idea to extend Newton's method to be theinverse quadratic interpolation. We prove that for a sufficientlysmooth function $f$ in a neighborhood of $z$ the order of theconvergence is quartic. Using Mathematica with its high precisioncompatibility, we present some numerical examples to confirm thetheoretical results and to compare our method with the others givenin the literature.


Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 420 ◽  
Author(s):  
Alejandro Moysi ◽  
Ioannis K. Argyros ◽  
Samundra Regmi ◽  
Daniel González ◽  
Á. Alberto Magreñán ◽  
...  

Solving problems in various disciplines such as biology, chemistry, economics, medicine, physics, and engineering, to mention a few, reduces to solving an equation. Its solution is one of the greatest challenges. It involves some iterative method generating a sequence approximating the solution. That is why, in this work, we analyze the convergence in a local form for an iterative method with a high order to find the solution of a nonlinear equation. We extend the applicability of previous results using only the first derivative that actually appears in the method. This is in contrast to either works using a derivative higher than one, or ones not in this method. Moreover, we consider the dynamics of some members of the family in order to see the existing differences between them.


2012 ◽  
Vol 220-223 ◽  
pp. 2585-2588
Author(s):  
Zhong Yong Hu ◽  
Fang Liang ◽  
Lian Zhong Li ◽  
Rui Chen

In this paper, we present a modified sixth order convergent Newton-type method for solving nonlinear equations. It is free from second derivatives, and requires three evaluations of the functions and two evaluations of derivatives per iteration. Hence the efficiency index of the presented method is 1.43097 which is better than that of classical Newton’s method 1.41421. Several results are given to illustrate the advantage and efficiency the algorithm.


2012 ◽  
Vol 220-223 ◽  
pp. 2658-2661
Author(s):  
Zhong Yong Hu ◽  
Liang Fang ◽  
Lian Zhong Li

We present a new modified Newton's method with third-order convergence and compare it with the Jarratt method, which is of fourth-order. Based on this new method, we obtain a family of Newton-type methods, which converge cubically. Numerical examples show that the presented method can compete with Newton's method and other known third-order modifications of Newton's method.


Sign in / Sign up

Export Citation Format

Share Document