/ / Article
Special Issue

## Recent Developments on Sequence Spaces and Compact Operators with Applications

View this Special Issue

Research Article | Open Access

Volume 2014 |Article ID 410410 | 18 pages | https://doi.org/10.1155/2014/410410

# Optimal Sixteenth Order Convergent Method Based on Quasi-Hermite Interpolation for Computing Roots

Accepted03 Jul 2014
Published12 Aug 2014

#### Abstract

We have given a four-step, multipoint iterative method without memory for solving nonlinear equations. The method is constructed by using quasi-Hermite interpolation and has order of convergence sixteen. As this method requires four function evaluations and one derivative evaluation at each step, it is optimal in the sense of the Kung and Traub conjecture. The comparisons are given with some other newly developed sixteenth-order methods. Interval Newton’s method is also used for finding the enough accurate initial approximations. Some figures show the enclosure of finitely many zeroes of nonlinear equations in an interval. Basins of attractions show the effectiveness of the method.

#### 1. Introduction

Let us consider the problem of approximating the simple root of the nonlinear equation involving a nonlinear univariate function : Newton’s method and its variants have always remained as widely used one-point without memory and one-step methods for solving (1). However, the usage of single point and one-step methods puts limit on the order of convergence and computational efficiency is given as where is the order of convergence of the iterative method and is the cost of evaluating and its derivatives.

To overcome the drawbacks of one-point, one-step methods, many multipoint multistep higher order convergent methods have been introduced in the recent past by using inverse, Hermite, and rational interpolation [1, 2]. In developing these methods, so far, the conjecture of Kung and Traub has remained the focus of attention. It states the following.

Conjecture 1. An optimal iterative method without memory based on n evaluations would achieve an optimal convergence order of , hence, a computational efficiency of .

In [3, 4], Petkovi presented a general optimal -point iterative scheme without memory defined by where is the approximation of the root at the th iteration and is an arbitrary fourth-order, two-point method requiring three function evaluations: is Newton’s method. The derivative at -step is approximated through quasi-Hermite interpolatory polynomial of degree , denoted by .

Using this approach, Sargolzaei and Soleymani  presented a three-step optimal eighth-order iterative method. However, since the authors approximated the derivative at the fourth step by using Hermite interpolatory polynomials of degree three, therefore the fourth-step method given by Sargolzaei and Soleymani has order of convergence fourteen including five function evaluations, which is not optimal in the sense of Kung and Traub.

In this paper, we present an optimal four-step four-point sixteenth-order convergent method by using quasi-Hermite interpolation from the general class of Petkovi [3, 4]. The interpolation is done by using the Newtonian formulation given by Traub . The numerical comparisons are given in Section 4 with recent optimal sixteenth-order convergent methods based on rational interpolants. Since, the first step of our method is Newton’s method, thus to overcome the drawbacks of Newton’s method we have calculated, in Section 5, accurate initial guess required for the convergence of this method for some oscillatory functions.

#### 2. Construction of Method

We define the following: where and are any arbitrary fourth- and eighth-order, multipoint methods. We, now, approximate with a quasi-Hermite interpolatory polynomial of degree four satisfying To construct the interpolatory polynomial , satisfying the above conditions, we apply the Newtonian representation of the interpolatory polynomial satisfying the conditions Traub [6, p. 243] have given this as follows: The confluent divided differences involved here are defined as In particular, is the usual divided difference. Here, we take , , , and hence, , , , and . Expanding (8), we get Differentiating (11) with respect to “” and substituting in the above equation, we obtain where Using representation (12) of in place of at the fourth step, the new four-step iterative method is obtained as where and are any fourth- and eighth-order convergent methods, respectively, and

Theorem 2. Let one consider as a root of nonlinear equation (1) in the domain and assume that is sufficiently differentiable in the neighbourhood of the root. Then the iterative method defined by (14) is of optimal order sixteen and has the following error equation: where , for , are defined by

Proof. We write the Taylor series expansion of the function about the simple root in th iteration. Let . Therefore, we have Also, we obtain Now, we find the Taylor expansion of , the first step, by using the above two expressions (18) and (19). Hence, we have Also, we need the Taylor expansion of ; that is In second step, we take a general fourth-order convergent method as Now, we find the Taylor expansion of each divided difference used at the third step. We thus obtain In the third step, we take a general eighth-order convergent method as follows: and the Taylor expansion for is Now, we find the Taylor expansion of divided differences used at the last step. We, thus, obtain Hence, our fourth step defined in (14) becomes which manifests that (14) is a four-step iterative method of optimal order of convergence of sixteen consuming four function evaluations and one derivative evaluation.

Remark 3. It is concluded from Theorem 2 that the new sixteenth-order convergent iterative method (14) for solving nonlinear equations satisfies the conjecture of Kung and Traub that a multipoint method without memory with four evaluations of functions and a derivative evaluation can achieve an optimal sixteenth order of convergence and an efficiency index of .

#### 3. Some Particular Methods

In this section, we consider some particular methods from the newly developed family of the sixteenth-order convergent iterative methods.

##### 3.1. Iterative Method M1

Here, we take as two-step fourth-order convergent method defined by Geum and Kim  and the third-step is replaced by the third step of eighth-order convergent method given by  using Hermite interpolation. Hence, our four-step method becomes where is given by (15).

##### 3.2. Iterative Method M2

Here, we define as King’s two-step fourth-order convergent method  with , as Hence, our four-step iterative method becomes where is given by (15).

#### 4. Numerical Results and Computational Cost

In this section, we compare our newly constructed family of iterative methods of optimal sixteenth-order M1 and M2 defined in (28) and (30), respectively, with some famous equation solvers. For the sake of comparison, we consider the fourteenth-order convergent method (PF) given by Sargolzaei and Soleymani  and the optimal sixteenth-order convergent methods (JRP) and (FSH) given by Sharma et al.  and Soleymani et al. , respectively. All the computations are done using software Maple 13 with tolerance and 4000 digits precision. The stopping criterion is Here, is the exact zero of the function and is the initial guess. In Tables 19, columns show the number of iterations , in which the method converges to , the absolute value of function at th step, for . The numerical examples are taken from [1, 2].

 Numerical example Exact zero
 PF 3 JRP 3 FSH 3 M1 3 M2 3
 PF 3 JRP 3 FSH 3 M1 3 M2 3
 PF 3 JRP 3 FSH 3 M1 3 M2 3
 PF 3 0.00023181 JRP 3 0.00001307 FSH 3 0.00023181 M1 3 0.00023181 M2 3
 PF 3 JRP 3 0 FSH 3 0 M1 3 0 M2 3 0
 PF 3 JRP 3 0 FSH 3 M1 3 0 M2 3 0