Improved Chebyshev–Halley methods with sixth and eighth order convergence
Introduction
The construction of fixed point iterative methods for solving the nonlinear equation is an important and interesting task in numerical analysis and many applied scientific disciplines. A great importance of this subject has led to the development of many iterative methods. Although iterative methods were extensively studied in Traub’s book [1] and some books and papers published in the 1960s, 70s and 80s (see, e.g., [2], [3], [4], [5], [6], [7], [8], [9]). The interest for these methods has renewed in recent years due to the rapid development of digital computers, advanced computer arithmetics and symbolic computation.
Traub [1] has divided iterative methods into two classes, viz. one-point iterative methods and multipoint iterative methods. The important features of these classes of methods are order of convergence and computational efficiency. Order of convergence shows the speed with which a given sequence of iterates converges to the root while the computational efficiency concerns with the economy of the entire process and is defined by (see [2]), where p is the order of convergence and n is the total number of function evaluations required per iteration. Investigation of one-point iterative methods has demonstrated theoretical restrictions on the order and efficiency of these methods (see [1]). However, Kung and Traub [5] have conjectured that multipoint iterative methods without memory based on n evaluations have optimal order . For example, with three function evaluations a two-point method of optimal fourth order convergence can be constructed (see [2], [3], [4], [10], [11]) and with four function evaluations a three-point method of optimal eighth order convergence can be developed [12], [13], [14]. A more extensive list of references as well as a survey on progress made on the class of multipoint methods may be found in the recent book by Petković et al. [15].
The most basic method in the class of one-point methods is the Newton’s method [2] which is given aswhere is the initial guess to a root. This method has quadratic convergence and requires two evaluations per iteration, namely f and . In order to improve the convergence of Newton’s method, researchers have also proposed cubically convergent one-point methods. One such scheme is the well-known family of Chebyshev–Halley methods [16], which is defined aswhere and . Per iteration, the formula requires three evaluations, namely one each of and . This family includes the classical Chebyshev’s method for , Halley’s method for and super-Halley method for . For details of these methods, the readers are referred to [17], [18], [19]. It is quite clear that the practical application of Chebyshev–Halley type methods is restricted in the problems where second derivative is difficult to evaluate. This fact has motivated many researchers to explore second derivative free two-point variants of Chebyshev–Halley methods with Newton’s or Newton-like iteration as the first step, see [20], [21], [22], [23] and references therein. Majority of such variants possess the third order convergence. Some modifications, however, achieve optimal fourth order convergence [22], [23].
Based on second derivative free two-point modified Chebyshev–Halley methods, researchers have also proposed three-point methods. For example, Li et al. [24] have recently considered the following scheme of modified Chebyshev–Halley methods
As this scheme requires five function evaluations, so to reduce the number of function evaluations Li et al. have used the following approximation of the derivative at the point where . It has been shown that this scheme has fifth order convergence when . For , the order is six. It is easy to see that the scheme (3) on using (4) requires four function evaluations, viz. three f and one . However, with the same number of evaluations a more higher order scheme (even a scheme of optimal eighth order) can be achieved. This is the main motivation of present work.
In this paper we consider the modified Chebyshev–Halley scheme (3) and present a one-parameter family of methods with sixth order of convergence. Furthermore, it is shown that a particular value of the used parameter produces eighth order convergence. The family consumes same number of function evaluations as that of the method by Li et al. In this way the eighth order method of the family possesses optimal convergence according to Kung–Traub hypothesis [5]. In Section 2, the method with analysis of convergence is presented. The theoretical results proved in Section 2 are verified in Section 3 by considering various numerical examples. Section 4 includes the concluding remarks.
Section snippets
The family of methods
In what follows, we consider the three-point modified Chebyshev–Halley scheme (3). To reduce the number of evaluations we approximate the first derivative by using Newton interpolatory polynomial of degree three set through the available approximations and . Thus, considering the Newton interpolatory polynomial (say, ) of degree three,
The divided differences used here are defined as
Numerical examples
In order to demonstrate the convergence behavior of present methods and to check the validity of theoretical results we employ MCHM for (MCM), (MHM) and (MSHM) to solve some nonlinear equations. We compare the present methods with Newton’s method (1) and the special cases of Chebyshev–Halley method (2), namely, Chebyshev’s method (CM), Halley’s method (HM) and super-Halley method (SHM).
The considered test functions with corresponding zero and its initial approximation are
Conclusions
In this work, we have obtained a one-parameter family of modified Chebyshev–Halley methods for solving nonlinear equations. Unlike that of third order Chebyshev–Halley scheme the presented scheme is free from second derivative. Analysis of convergence shows that the family possesses at least sixth order convergence and especially one member, the modified super-Halley method, has eighth order convergence. Each method of the family requires three functions and one first derivative evaluations per
References (31)
- et al.
Certain improvements of Newton’s method with fourth-order convergence
Appl. Math. Comput.
(2009) - et al.
On optimal fourth-order iterative methods free from second derivative and their dynamics
Appl. Math. Comput.
(2012) - et al.
A family of three-point methods of optimal order for solving nonlinear equations
J. Comput. Appl. Math.
(2010) - et al.
Construction of optimal order nonlinear solvers using inverse interpolation
Appl. Math. Comput.
(2010) - et al.
A family of optimal three-point methods for solving nonlinear equations using two parametric functions
Appl. Math. Comput.
(2011) - et al.
An acceleration of Newton’s method: super-Halley method
Appl. Math. Comput.
(2001) - et al.
Geometric constructions of iterative functions to solve nonlinear equations
J. Comput. Appl. Math.
(2003) - et al.
On Halley-type iterations with free second derivative
J. Comput. Appl. Math.
(2004) - et al.
Modified Chebyshev’s method free from second derivative for non-linear equations
Appl. Math. Comput.
(2007) Some second-derivative-free variants of Chebyshev–Halley methods
Appl. Math. Comput.
(2007)
Some second-derivative-free variants of super-Halley method with fourth-order convergence
Appl. Math. Comput.
An improvement of Chebyshev–Halley methods free from second derivative
Appl. Math. Comput.
A new sixth-order scheme for nonlinear equations
Appl. Math. Lett.
Modifications of higher-order convergence for solving nonlinear equations
J. Comput. Appl. Math.
The construction of rational iterative methods for solving nonlinear equations
Appl. Math. Comput.
Cited by (13)
An optimal reconstruction of Chebyshev–Halley type methods for nonlinear equations having multiple zeros
2019, Journal of Computational and Applied MathematicsOn the convergence of a higher order family of methods and its dynamics
2017, Journal of Computational and Applied MathematicsOn the local convergence and the dynamics of Chebyshev-Halley methods with six and eight order of convergence
2016, Journal of Computational and Applied MathematicsCitation Excerpt :Chun et al. [6], Magreñán [13,14], and many others [15–21,12,22–29,4,30,31] have found interesting dynamical planes, including periodical behavior and others anomalies. One of our main interests in this paper is the study of the parameter spaces associated to a family of iterative methods, which allow us to distinguish between the good and bad methods in terms of its numerical properties.
Ball convergence comparison between three iterative methods in Banach space under hypothese only on the first derivative
2015, Applied Mathematics and ComputationAn optimal reconstruction of chebyshev-halley-type methods with local convergence analysis
2020, International Journal of Computational MethodsConvergence and dynamics of a higher-order method
2020, Symmetry