About this Journal Submit a Manuscript Table of Contents
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 568740, 15 pages
http://dx.doi.org/10.1155/2012/568740
Research Article

A Class of Three-Step Derivative-Free Root Solvers with Optimal Convergence Order

1Young Researchers Club, Islamic Azad University, Zahedan Branch, Zahedan, Iran
2Department of Mathematics, Islamic Azad University, Zahedan Branch, Zahedan, Iran

Received 8 October 2011; Accepted 1 November 2011

Academic Editor: Yeong-Cheng Liou

Copyright © 2012 F. Soleymani et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

A class of three-step eighth-order root solvers is constructed in this study. Our aim is fulfilled by using an interpolatory rational function in the third step of a three-step cycle. Each method of the class reaches the optimal efficiency index according to the Kung-Traub conjecture concerning multipoint iterative methods without memory. Moreover, the class is free from derivative calculation per full iteration, which is important in engineering problems. One method of the class is established analytically. To test the derived methods from the class, we apply them to a lot of nonlinear scalar equations. Numerical examples suggest that the novel class of derivative-free methods is better than the existing methods of the same type in the literature.

1. Introduction

One of the common problems encountered in engineering problems is that given a single variable function 𝑓(𝑥), find the values of 𝑥 for which 𝑓(𝑥)=0. The solutions (values of 𝑥) are known as the roots of the equation 𝑓(𝑥)=0, or the zeros of the function 𝑓(𝑥). The root of such nonlinear equations may be real or complex. In general, an equation may have any number of (real) roots or no roots at all. There are two general types of methods available to find the roots of algebraic and transcendental equations. First, direct methods, which are not always applicable to find the roots, and second, iterative methods based on the concept of successive approximations. In this case, the general procedure is to start with one or more initial approximation(s) to the root and attain a sequence of iterates, which in the limit converges to the true solution [1].

Here, we focus on the simple roots of nonlinear scalar equations by iterative methods. The prominent one-point (or one-step) Newton’s method of order two, which is a basic tool in numerical analysis and numerous applications, has widely been applied and discussed in the literature; see, for example, [27]. Newton’s iteration and any of its variants, include derivative calculation per full cycle to proceed, which is not useful in engineering problems. Since the calculation of more derivatives often takes up an eye-catching time.

To remedy this, first Steffensen coined the following quadratical scheme: 𝑥𝑛+1=𝑥𝑛𝑓(𝑥𝑛)2/(𝑓(𝑥𝑛+𝑓(𝑥𝑛))𝑓(𝑥𝑛)). Inspired by this method, so many techniques with better orders of convergence have been provided through two- or three-step cycles; see [8] and the bibliographies therein. In between, the concept of optimality, which was mooted by Kung-Traub [9], also plays a crucial role; a multipoint method for solving nonlinear scalar equations without memory has the optimal order 2(𝑛1)/𝑛, where 𝑛 is the total number of evaluations per full cycle. In what follows, we review some of the significant derivative-free iterations.

Peng et al. in [10] investigated an optimal two-step derivative-free technique as comes next𝑤𝑛=𝑥𝑛𝑓𝑥𝑛𝑔𝑥𝑛,𝑥𝑛+1=𝑥𝑛𝑓𝑥𝑛𝑔𝑥𝑛𝑓𝑤1+𝑛𝑓𝑥𝑛+11+1𝑡𝑛𝑔𝑥𝑛𝑓(𝑤𝑛)𝑓(𝑥𝑛)2,(1.1) where 𝑔(𝑥𝑛)=(𝑓(𝑥𝑛)𝑓(𝑥𝑛𝑡𝑛𝑓(𝑥𝑛)))/(𝑡𝑛𝑓(𝑥𝑛)) and 𝑡𝑛 is adaptively determined.

Ren et al. in [11] furnished an optimal quartical scheme using divided differences as follows:𝑦𝑛=𝑥𝑛𝑓(𝑥𝑛)2𝑓𝑥𝑛𝑥+𝑓𝑛𝑥𝑓𝑛,𝑥𝑛+1=𝑦𝑛𝑓𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑦+𝑓𝑛,𝑤𝑛𝑥𝑓𝑛,𝑤𝑛𝑦+𝑎𝑛𝑥𝑛𝑦𝑛𝑤𝑛,(1.2) where 𝑤𝑛=𝑥𝑛+𝑓(𝑥𝑛) and 𝑎.

Taking into account the divided differences, [12] contributed the following two-step optimal method:𝑦𝑛=𝑥𝑛𝑓𝑥𝑛2𝑓𝑥𝑛𝑥+𝑓𝑛𝑥𝑓𝑛,𝑥𝑛+1=𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑦𝑓𝑛,𝑤𝑛𝑥+𝑓𝑛,𝑤𝑛𝑓𝑥𝑛,𝑦𝑛2𝑓𝑦𝑛,(1.3) where 𝑤𝑛=𝑥𝑛+𝑓(𝑥𝑛). Note that the notation of divided differences will be used throughout this paper. Therefore, we have 𝑓[𝑥𝑖,𝑥𝑗]=(𝑓(𝑥𝑖)𝑓(𝑥𝑗))/(𝑥𝑖𝑥𝑗), 𝑖,𝑗𝑁,𝑖𝑗.

In 2011, Khattri and Argyros [13] formulated a sixth-order method as follows:𝑦𝑛=𝑥𝑛𝑓𝑥𝑛2𝑓𝑥𝑛𝑥𝑓𝑛𝑥𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑥𝑛𝑓𝑦𝑛𝑓𝑥𝑛𝑥𝑓𝑛𝑥𝑓𝑛𝑓𝑦1+𝑛𝑓𝑥𝑛+𝑓𝑦𝑛𝑓𝑥𝑛𝑥𝑓𝑛,𝑥𝑛+1=𝑧𝑛𝑓𝑥𝑛𝑓𝑧𝑛𝑓𝑥𝑛𝑥𝑓𝑛𝑥𝑓𝑛𝑓𝑦1+𝑛𝑓𝑥𝑛+𝑓𝑦𝑛𝑓𝑥𝑛𝑥𝑓𝑛.(1.4)

Very recently, Thukral in [14] gave the following optimal eighth-order derivative-free iterations without memory:𝑦𝑛=𝑥𝑛𝑓𝑥𝑛2𝑓𝑤𝑛𝑥𝑓𝑛,𝑤𝑛=𝑥𝑛𝑥+𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑥𝑛,𝑤𝑛𝑓𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑓𝑤𝑛,𝑦𝑛,𝑥𝑛+1=𝑧𝑛𝑓𝑧𝑛𝑓𝑦𝑛,𝑧𝑛𝑥𝑓𝑛,𝑦𝑛𝑥+𝑓𝑛,𝑧𝑛𝑓𝑧1𝑛𝑓𝑤𝑛1𝑦1+2𝑓𝑛3𝑓𝑤𝑛2𝑓𝑥𝑛1,(1.5) and also𝑦𝑛=𝑥𝑛𝑓𝑥𝑛2𝑓𝑤𝑛𝑥𝑓𝑛,𝑤𝑛=𝑥𝑛𝑥+𝛽𝑓𝑛𝑧,𝛽{0},𝑛=𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑦𝑓𝑛,𝑤𝑛𝑥+𝑓𝑛,𝑤𝑛𝑓[𝑥𝑛,𝑦𝑛]2𝑓𝑦𝑛,𝑥𝑛+1=𝑧𝑛𝑓𝑧𝑛𝑓𝑦𝑛,𝑧𝑛𝑥𝑓𝑛,𝑦𝑛𝑥+𝑓𝑛,𝑧𝑛𝑓𝑧1𝑛𝑓𝑤𝑛1×𝑓𝑦1𝑛𝑓𝑧𝑛3𝑓𝑦1+𝑛3𝑓𝑧𝑛2𝑓𝑥𝑛1.(1.6)

Unfortunately, by error analysis, we have found that (1.6) (relation (2.32) in [14]) does not possess the convergence order eight. Thus, it is not optimal in the sense of Kung-Traub’s conjecture. Hence, (1.6) is excluded from our list of optimal eighth-order derivative-free methods. Note that (2.27) of [14] has also an eye-catching typo in its structure, which does not produce optimal order.

Derivative-free methods [1517] have so many applications in contrast to the derivative-involved methods. Anyhow, there are some other factors, except being free from derivative or high order of convergence in choosing a method for root finding; for example, we refer the readers to [18], to see the importance of initial guesses in this subject matter. For further reading, one may refer to [1926].

This research contributes a general class of three-step methods without memory using four points (we mean the evaluations of the function need to be computed four times per step) and four evaluations per full cycle for solving single-variable nonlinear equations. The contributed class has some important features in what follows. First, it reaches the optimal efficiency index 1.682. Second, it is free from derivative calculation per full cycle, which is so much fruitful for engineering and optimization problems. Third, using any optimal quartically convergent derivative-free two-step method in its first two steps will yield a new optimal eighth-order derivative-free iteration without memory in the sense of Kung-Traub’s conjecture [9]. Finally, we will find that the new eighth-order derivative-free methods are fast and convergent.

2. Main Contribution

Consider the nonlinear scalar function 𝑓𝐷 that is sufficiently smooth in the neighborhood 𝐷, of a simple zero 𝛼. To construct derivative-free methods of optimal order eight, we consider a three-step cycle in which the first two steps are any of the optimal two-step derivative-free schemes without memory as follows:𝑥Optimaltwo-stepderivative-freemethod𝑛and𝑤𝑛𝑦areavailable,𝑛𝑥isavailable,𝑛+1=𝑧𝑛𝑓𝑧𝑛𝑓𝑧𝑛.(2.1)

Please note that 𝑤𝑛=𝑥𝑛+𝛽𝑓(𝑥𝑛) or 𝑤𝑛=𝑥𝑛𝛽𝑓(𝑥𝑛), where 𝛽{0} is specified by the user. The value of 𝑤𝑛 completely relies on the two-point method allocated in the first two steps of (2.1). The purpose of this paper is to establish new derivative-free methods with optimal order; hence, we reduce the number of evaluations from five to four by using a suitable approximation of the new-appeared derivative. Now to attain a class of optimal eighth-order techniques free from derivative, we should approximate 𝑓(𝑧𝑛) using the known values, that is, 𝑓(𝑥𝑛), 𝑓(𝑤𝑛), 𝑓(𝑦𝑛), and 𝑓(𝑧𝑛). We do this procedure by applying the nonlinear rational fraction inspired by Padé approximant as follows:𝑎𝑝(𝑡)=0+𝑎1𝑡𝑥𝑛+𝑎2𝑡𝑥𝑛21+𝑎3𝑡𝑥𝑛,(2.2) where 𝑎1𝑎0𝑎30.

The general setup in approximation theory is that a function 𝑓 is given and next a user wants to estimate it with a simpler function 𝑔 but in such a way that the difference between 𝑓 and 𝑔 is small. The advantage is that the simpler function 𝑔 can be handled without too many difficulties. Polynomials are not always a good class of functions if one desires to estimate scalar functions with singularities, because polynomials are entire functions without singularities. They are only useful up to the first singularity of 𝑓 near the singularity point. Rational functions (the concept of the Padé approximant) are the simplest functions with singularities. The idea is that the poles of the rational functions will move to the singularities of the function 𝑓, and hence the domain of convergence can be enlarged. The [𝑚,𝑛] Padé approximant of 𝑓 is the rational function 𝑄𝑚/𝑃𝑛, where 𝑄𝑚 is a polynomial of degree 𝑚 and 𝑃𝑛 is a polynomial of degree 𝑛, in which the interpolation condition is satisfied. As a matter of fact, (2.2) is an interpolatory rational function, which is inspired by the Padé approximant.

Hence, by substituting the known values in (2.2), that is 𝑓(𝑥𝑛)=𝑝(𝑥𝑛), 𝑓(𝑤𝑛)=𝑝(𝑤𝑛), 𝑓(𝑦𝑛)=𝑝(𝑦𝑛), and 𝑓(𝑧𝑛)=𝑝(𝑧𝑛), we have the following system of three linear equations with three unknowns (𝑎0=𝑓(𝑥𝑛) is obvious):𝑤𝑛𝑥𝑛𝑤𝑛𝑥𝑛2𝑤𝑓𝑛𝑤𝑛𝑥𝑛𝑦𝑛𝑥𝑛𝑦𝑛𝑥𝑛2𝑦𝑓𝑛𝑦𝑛𝑥𝑛𝑧𝑛𝑥𝑛𝑧𝑛𝑥𝑛2𝑧𝑓𝑛𝑧𝑛𝑥𝑛𝑎1𝑎2𝑎3=𝑓𝑤𝑛𝑥𝑓𝑛𝑓𝑦𝑛𝑥𝑓𝑛𝑓𝑧𝑛𝑥𝑓𝑛,(2.3) which has the follow-up solution after simplifying𝑎3=𝑤𝑛𝑓𝑧𝑛,𝑥𝑛𝑦𝑓𝑛,𝑥𝑛𝑧𝑓𝑛,𝑥𝑛𝑦𝑛𝑤+𝑓𝑛,𝑥𝑛𝑦𝑛𝑧𝑛𝑦+𝑓𝑛,𝑥𝑛𝑧𝑛𝑧𝑛𝑦𝑛𝑓𝑤𝑛+𝑤𝑛𝑧𝑛𝑓𝑦𝑛+𝑦𝑛𝑤𝑛𝑓𝑧𝑛,𝑎2=𝑓𝑤𝑛,𝑥𝑛𝑦𝑓𝑛,𝑥𝑛+𝑎3𝑓𝑤𝑛𝑦𝑓𝑛𝑤𝑛𝑦𝑛𝑤=𝑓𝑛,𝑥𝑛,𝑦𝑛+𝑎3𝑓𝑤𝑛,𝑦𝑛,𝑎1𝑤=𝑓𝑛,𝑥𝑛𝑤+𝑓𝑛𝑎3𝑤𝑛𝑥𝑛𝑎2.(2.4)

At present, by using (2.1) and (2.4), we have the following efficient and accurate class𝑥Optimaltwo-stepderivative-freemethod𝑛and𝑤𝑛𝑦areavailable,𝑛𝑥isavailable,𝑛+1=𝑧𝑛1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2.(2.5)

By considering any optimal two-step derivative-free method in the first two steps of (2.5), we attain a new optimal derivative-free eighth-order technique. Applying (1.3), we have𝑦𝑛=𝑥𝑛𝑓(𝑥𝑛)2𝑓𝑤𝑛𝑥𝑓𝑛,𝑤𝑛=𝑥𝑛𝑥+𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑦𝑓𝑛,𝑤𝑛𝑥+𝑓𝑛,𝑤𝑛𝑓[𝑥𝑛,𝑦𝑛]2𝑓𝑦𝑛,𝑥𝑛+1=𝑧𝑛1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2.(2.6)

To obtain the solution of any nonlinear scalar equation by the new derivative-free methods, we must set a particular initial approximation 𝑥0, ideally close to the simple root. In numerical analysis, it is very useful and essential to know the behavior of an approximate method. Therefore, we are about to prove the convergence order of (2.6).

Theorem 2.1. Let 𝛼 be a simple root of the sufficiently differentiable function 𝑓 in an open interval 𝐷. If 𝑥0 is sufficiently close to 𝛼, then (2.6) is of eighth order and satisfies the error equation below𝑒𝑛+1=1+𝑐12𝑐22+𝑐1𝑐22𝑐11+𝑐1𝑐32+𝑐1𝑐42𝑐11+𝑐1𝑐22𝑐3𝑐211+𝑐1𝑐23+𝑐211+𝑐1𝑐2𝑐4𝑐71×𝑒8𝑛𝑒+𝑂9𝑛,(2.7) where 𝑒𝑛=𝑥𝑛𝛼, and 𝑐𝑘=𝑓(𝑘)(𝛼)/𝑘!, 𝑘=1,2,3,.

Proof. We provide the Taylor series expansion of any term involved in (2.6). By Taylor expanding around the simple root in the 𝑛th iterate, we have 𝑓(𝑥𝑛)=𝑐1𝑒𝑛+𝑐2𝑒2𝑛+𝑐3𝑒3𝑛+𝑐4𝑒4𝑛+𝑐5𝑒5𝑛+𝑐6𝑒6𝑛+𝑐7𝑒7𝑛+𝑐8𝑒8𝑛+𝑂(𝑒9𝑛). Furthermore, it is easy to find 𝑓𝑥𝑛2𝑓𝑤𝑛𝑥𝑓𝑛=𝑒1𝑛1+𝑐1𝑐2𝑐1𝑒2𝑛+2+𝑐12+𝑐1𝑐22𝑐11+𝑐12+𝑐1𝑐3𝑐21𝑒3𝑛𝑒++𝑂9𝑛.(2.8) By considering this relation and the first step of (2.6), we obtain 𝑦𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛,𝑤𝑛1=𝛼+1+𝑐1𝑐2𝑒2𝑛+2+2+𝑐1𝑐1𝑐22+𝑐11+𝑐12+𝑐1𝑐3𝑐21𝑒3𝑛𝑒++𝑂9𝑛.(2.9) At this time, we should expand 𝑓(𝑦𝑛) around the root by taking into consideration (2.9). Accordingly, we have 𝑓𝑦𝑛=1+𝑐1𝑐2𝑒2𝑛+2+𝑐12+𝑐1𝑐22𝑐1+1+𝑐12+𝑐1𝑐3𝑒3𝑛𝑒++𝑂9𝑛.(2.10) Using (2.9) and (2.10) in the second step of (2.6) results in 𝑧𝑛𝛼=1+𝑐1𝑐22+𝑐1𝑐22𝑐11+𝑐1𝑐3𝑐31𝑒4𝑛1𝑐4110+𝑐116+𝑐19+2𝑐1𝑐42𝑐11+𝑐114+𝑐113+4𝑐1𝑐22𝑐3+𝑐211+𝑐122+𝑐1𝑐23+𝑐211+𝑐122+𝑐1𝑐2𝑐4𝑒5𝑛+1𝑐5131+𝑐153+𝑐139+𝑐116+3𝑐1𝑐52𝑐14+3𝑐118+𝑐122+3𝑐14+𝑐1𝑐32𝑐3+𝑐211+𝑐121+4𝑐17+𝑐14+𝑐1𝑐22𝑐4𝑐311+𝑐127+𝑐17+2𝑐1𝑐3𝑐4+𝑐211+𝑐1𝑐22+𝑐115+𝑐113+5𝑐1𝑐23𝑐11+𝑐13+𝑐13+𝑐1𝑐5×𝑒6𝑛𝑒++𝑂9𝑛.(2.11) On the other hand, we have 𝑓𝑧𝑛=1+𝑐1𝑐22+𝑐1𝑐22𝑐11+𝑐1𝑐3𝑐21𝑒4𝑛𝑒++𝑂9𝑛.(2.12) We also have the following Taylor series expansion for the approximation of 𝑓(𝑧𝑛) in the third step using (2.11): 𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛21+𝑎3𝑧𝑛𝑥𝑛2=𝑐1+1𝑐311+𝑐122+𝑐1𝑐422𝑐11+𝑐1𝑐22𝑐3𝑐211+𝑐1𝑐23+𝑐211+𝑐1𝑐2𝑐4𝑒4𝑛𝑒++𝑂9𝑛.(2.13) Now by applying (2.12) and (2.13), we attain 1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2=1+𝑐1𝑐22+𝑐1𝑐22𝑐11+𝑐1𝑐3𝑐31𝑒4𝑛1𝑐4110+𝑐116+𝑐19+2𝑐1𝑐42𝑐11+𝑐114+𝑐113+4𝑐1𝑐22𝑐3+𝑐211+𝑐122+𝑐1𝑐23+𝑐211+𝑐122+𝑐1𝑐2𝑐4𝑒5𝑛𝑒++𝑂9𝑛.(2.14) At this time, by applying (2.14) in (2.6), we obtain 𝑒𝑛+1=1+𝑐12𝑐22+𝑐1𝑐22𝑐11+𝑐1𝑐32+𝑐1𝑐42𝑐11+𝑐1𝑐22𝑐3𝑐211+𝑐1𝑐23+𝑐211+𝑐1𝑐2𝑐4𝑐71×𝑒8𝑛𝑒+𝑂9𝑛.(2.15) This ends the proof and shows that (2.6) is an optimal eighth-order derivative-free scheme without memory.

As a consequence using (1.2), we attain the following biparametric eighth-order family𝑦𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛,𝑤𝑛,𝑤𝑛=𝑥𝑛𝑥+𝛽𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑦+𝑓𝑛,𝑤𝑛𝑥𝑓𝑛,𝑤𝑛𝑦+𝑎𝑛𝑥𝑛𝑦𝑛𝑤𝑛,𝑥𝑛+1=𝑧𝑛1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2,(2.16) which satisfies the following error equation:𝑒𝑛+1=1+𝛽𝑐14𝑐2𝑐22+𝑐1𝑐3𝑐+a42𝑐21𝑐23+𝑐21𝑐2𝑐4+𝑐1𝑐22𝑐3+a𝑐71𝑒8𝑛𝑒+𝑂9𝑛,(2.17) with 𝑎 and 𝛽{0}. In what follows, we give other methods that can simply be constructed using the approach given above and just by varying the first two steps and using optimal derivative-free quartical iterations. Therefore, as other examples, we have𝑦𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛,𝑤𝑛,𝑤𝑛=𝑥𝑛𝑥𝛽𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑦𝑛𝑓𝑥𝑛,𝑦𝑛𝑦+𝑓𝑛,𝑤𝑛𝑥𝑓𝑛,𝑤𝑛𝑦+𝑎𝑛𝑥𝑛𝑦𝑛𝑤𝑛,𝑥𝑛+1=𝑧𝑛1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2,(2.18) which satisfies the following error equation:𝑒𝑛+1=1+𝛽𝑐14𝑐2𝑐22+𝑐1𝑐3𝑐+𝑎42𝑐21𝑐23+𝑐21𝑐2𝑐4+𝑐1𝑐22𝑐3+𝑎𝑐71𝑒8𝑛𝑒+𝑂9𝑛.(2.19) By considering 𝐺(0)=1, 𝐺(0)=(2+𝛽𝑓[𝑥𝑛,𝑤𝑛])/(1+𝛽𝑓[𝑥𝑛,𝑤𝑛]),|𝐺(0)|< in [17], we can have𝑦𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛,𝑤𝑛,𝑤𝑛=𝑥𝑛𝑥+𝛽𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑦𝑛𝑓𝑥𝑛,𝑤𝑛𝐺𝑡𝑛,𝑡𝑛=𝑓𝑦𝑛𝑓𝑥𝑛,𝑥𝑛+1=𝑧𝑛1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2,(2.20) with the follow-up error relation𝑒𝑛+1=14𝑐71𝑐21+𝑐1𝛽22𝑐1𝑐31+𝑐1𝛽+𝑐2225+𝑐1𝛽5+𝑐1𝛽+1+𝑐1𝛽2𝐺×(0)2𝑐1𝑐22𝑐31+𝑐1𝛽+2𝑐21𝑐231+𝑐1𝛽2𝑐21𝑐2𝑐41+𝑐1𝛽+𝑐4225+𝑐1𝛽5+𝑐1𝛽+1+𝑐1𝛽2𝐺𝑒(0)8𝑛𝑒+𝑂9𝑛.(2.21) We can also present by considering 𝐺(0)=1, 𝐺(0)=(2𝛽𝑓[𝑥𝑛,𝑤𝑛])/(1𝛽𝑓[𝑥𝑛,𝑤𝑛]), |𝐺(0)|<,𝑦𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛,𝑤𝑛,𝑤𝑛=𝑥𝑛𝑥𝛽𝑓𝑛,𝑧𝑛=𝑦𝑛𝑓𝑦𝑛𝑓𝑥𝑛,𝑤𝑛𝐺𝑡𝑛,𝑡𝑛=𝑓𝑦𝑛𝑓𝑥𝑛,𝑥𝑛+1=𝑧𝑛1+𝑎3𝑧𝑛𝑥𝑛2𝑓𝑧𝑛𝑎1𝑎0𝑎3+2𝑎2𝑧𝑛𝑥𝑛+𝑎2𝑎3𝑧𝑛𝑥𝑛2,(2.22) where 𝛽{0} and𝑒𝑛+1=14𝑐71𝑐21+𝑐1𝛽2𝑐221𝑐2𝑐41𝑐1𝛽+𝑐1𝑐22𝑐31+𝑐1𝛽+𝑐21𝑐231+𝑐1𝛽+𝑐425+𝑐1𝛽5+𝑐1𝛽+𝑐421+𝑐1𝛽2𝐺×(0)2𝑐1𝑐31+𝑐1𝛽+𝑐2225+𝑐1𝛽5+𝑐1𝛽+1+𝑐1𝛽2𝐺𝑒(0)8𝑛𝑒+𝑂9𝑛,(2.23) is its error equation.

In Table 1, a comparison of efficiency indices for different derivative-free methods of various orders is given. Equations (2.6), (2.16) or any optimal eighth-order scheme resulting from our class reaches the efficiency index 81/41.682, which is optimal according to the Kung-Traub hypothesis for multipoint iterative methods without memory for solving nonlinear scalar equations.

tab1
Table 1: Comparison of efficiency indices for different derivative-free methods.

Remark 2.2. The introduced approximation for 𝑓(𝑧𝑛) in the third step of (2.5) always doubles the convergence rate of the two-step method without memory given in its first two steps. That is, using any optimal fourth-order derivative-free method in its first two steps yields a novel three-step optimal eighth-order method without memory free from derivative. This makes our class interesting and accurate. Note that using any cubical derivative-free method without memory using three evaluations in the first two steps of (2.5) ends in a sixth-order derivative-free technique. This also shows that the introduced approximation for 𝑓(𝑧𝑛) doubles the convergence rate.
The free nonzero parameter 𝛽 plays a crucial rule for obtaining new numerical and theoretical results. In fact, if the user approximate 𝛽 per cycle with another iteration using only the available data at the first step, the convergence behavior of the refined method(s) will be improved. That is to say, a more efficient refined version of the attained optimal eighth-order derivative-free methods can be constructed by accepting an iteration for 𝛽 inside the real iterative scheme, as well as more computational burden. This way of obtaining new methods is called “with memory” iterations. Such developments can be considered as future improvements in this field. We here mention that according to the experimental results, choosing very small value for 𝛽, such as 1010, will mostly decrease the error equation, and thus the numerical output results will be more accurate and reliable without much more computational load.
In what follows, the findings are generalized by illustrating the effectiveness of the eighth-order methods for determining the simple root of a nonlinear equation.

3. Numerical Testing

The results given in Section 2 are supported through the numerical works. We here also mention a well-known derivative-involved method for comparisons to show the reliability of our derivative-free methods.

Wang and Liu [27] suggested an optimal derivative-involved eighth-order method as follows:𝑦𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛,𝑧𝑛=𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛𝑓𝑥𝑛𝑦𝑓𝑛𝑓𝑥𝑛𝑦2𝑓𝑛,𝑥𝑛+1=𝑧𝑛𝑓𝑧𝑛𝑓𝑥𝑛𝑥5𝑓𝑛2𝑥2𝑓𝑛𝑓𝑦𝑛𝑦+𝑓𝑛2𝑥5𝑓𝑛2𝑥12𝑓𝑛𝑓𝑦𝑛+𝑓𝑦1+4𝑛𝑓𝑥𝑛𝑓𝑧𝑛𝑓𝑦𝑛.(3.1)

Iteration (3.1) consists of derivative evaluation per full cycle, which is not good in engineering problems. Three methods of our class, (2.6), (2.16) with 𝛽=1,𝑎=0, (2.16) with 𝛽=0.01, 𝑎=0, are compared with the quartically schemes of Liu et al. (1.3) and Ren et al. (1.2) with 𝑎=0, the sixth-order scheme of Khattri and Argyros (1.4), the optimal eighth-order methods of Thukral (1.5). The comparison was also made by the derivative-involved method (3.1).

All the computations reported here were done using MATLAB 7.6 using VPA command, where for convergence we have selected the distance of two consecutive approximations to be less than 𝜀=1.𝐸6000. That is, |𝑥𝑛+1𝑥𝑛|106000 or |𝑓(𝑥𝑛)|106000. Scientific computations in many branches of science and technology demand very high precision degree of numerical precision. The test nonlinear scalar functions are listed in Table 2.

tab2
Table 2: Test functions and their roots.

The results of comparisons for the test functions are provided in Table 3. It can be seen that the resulting methods from our class are accurate and efficient in terms of number of accurate decimal places to find the roots after some iterations. In terms of computational cost, our class is much better than the compared methods. The class includes four evaluations of the function per full iteration to reach the efficiency index 1.682.

tab3
Table 3: Results of comparisons for test functions.

An important problem that appears in practical application of multipoint methods is that a quick convergence, one of the merits of multipoint methods, can be attained only if initial approximations are sufficiently close to the sought roots; otherwise, it is not possible to realize the expected convergence speed in practice. For this reason, in applying multipoint root-finding methods, a special attention should be paid to find good initial approximations. Yun in [28] outlined a noniterative way for this purpose as comes next 𝑥012𝑎+𝑏+sign(𝑓(𝑎))×𝑏𝑎,tanh(𝛿𝑓(𝑥))𝑑𝑥(3.2) where 𝑥0 is a simple root (an approximation of it) of 𝑓(𝑥)=0 on the interval [𝑎,𝑏] with 𝑓(𝑎)𝑓(𝑏)<0, and 𝛿 is a positive number in the set of natural numbers.

If the cost of derivatives is greater than that of function evaluation, then (3.1) or any optimal eighth-order derivative-involved method is not effective. To compare (2.5) with optimal eighth-order derivative-involved methods, we can use the (original) computational efficiency definition due to Traub [29]: 𝐶𝐸𝑇=𝑝1/𝑛𝑗=1Λ𝑗,(3.3) where Λ𝑗 is the cost of evaluating 𝑓(𝑗),𝑗0. If we take Λ0=1, we have 𝐶𝐸𝑇(2.5)81/4 and 𝐶𝐸𝑇(3.1)81/(3+Λ1), so that 𝐶𝐸(3.1)<𝐶𝐸(2.5) if Λ1>1.

4. Concluding Notes

The design of iterative formulas for solving nonlinear scalar equations is an interesting task in mathematics. On the other hand, the analytic methods for solving such equations are almost nonexistent, and therefore, it is only possible to obtain approximate solutions by relying on numerical methods based upon iterative procedures. In this work, we have contributed a simple yet powerful class of iterative methods for the solution of nonlinear scalar equations. The class was obtained by using the concept of Padé approximation (an interpolatory rational function) in the third step of a three-step cycle, in which the first two steps are available by any of the existing optimal fourth-order derivative-free methods without memory. We have seen that the introduced approximation of the first derivative of the function in the third step doubles the convergence rate. The analytical proof for one method of our novel class was written. Per full cycle, our class consists of four evaluations of the function and reaches the optimal order 8. Hence, the efficiency index of the class is 1.682, that is, the optimal efficiency index. The effectiveness of the developed methods from the class was illustrated by solving some test functions and comparing to the well-known derivative-free and derivative-involved methods. The results of comparisons were fully given in Table 3. Finally, it could be concluded that the novel class is accurate and efficient in contrast to the existing methods in the literature.

Acknowledgment

The authors would like to record their cordial thanks to the reviewer for his/her constructive remarks, which have considerably contributed to the readability of this paper.

References

  1. A. Iliev and N. Kyurkchiev, Nontrivial Methods in Numerical Analysis: Selected Topics in Numerical Analysis, LAP LAMBERT Academic Publishing, 2010. View at Zentralblatt MATH
  2. M. A. Hernández and N. Romero, “On the efficiency index of one-point iterative processes,” Numerical Algorithms, vol. 46, no. 1, pp. 35–44, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. F. Soleymani and M. Sharifi, “On a general efficient class of four-step root-finding methods,” International Journal of Mathematics and Computers in Simulation, vol. 5, pp. 181–189, 2011.
  4. F. Soleymani, “New optimal iterative methods in solving nonlinear equations,” International Journal of Pure and Applied Mathematics, vol. 72, no. 2, pp. 195–202, 2011.
  5. F. Soleymani, S. Karimi Vanani, and A. Afghani, “A general three-step class of optimal iterations for nonlinear equations,” Mathematical Problems in Engineering, vol. 2011, Article ID 469512, 10 pages, 2011. View at Publisher · View at Google Scholar
  6. P. Sargolzaei and F. Soleymani, “Accurate fourteenth-order methods for solving nonlinear equations,” Numerical Algorithms, vol. 58, no. 4, pp. 513–527, 2011. View at Publisher · View at Google Scholar
  7. F. Soleymani, “A novel and precise sixth-order method for solving nonlinear equations,” International Journal of Mathematical Models and Methods in Applied Sciences, vol. 5, pp. 730–737, 2011.
  8. F. Soleymani, “On a bi-parametric class of optimal eighth-order derivative-free methods,” International Journal of Pure and Applied Mathematics, vol. 72, pp. 27–37, 2011.
  9. H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration,” Journal of the Association for Computing Machinery, vol. 21, pp. 643–651, 1974. View at Zentralblatt MATH
  10. Y. Peng, H. Feng, Q. Li, and X. Zhang, “A fourth-order derivative-free algorithm for nonlinear equations,” Journal of Computational and Applied Mathematics, vol. 235, no. 8, pp. 2551–2559, 2011. View at Publisher · View at Google Scholar
  11. H. Ren, Q. Wu, and W. Bi, “A class of two-step Steffensen type methods with fourth-order convergence,” Applied Mathematics and Computation, vol. 209, no. 2, pp. 206–210, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. Z. Liu, Q. Zheng, and P. Zhao, “A variant of Steffensen's method of fourth-order convergence and its applications,” Applied Mathematics and Computation, vol. 216, no. 7, pp. 1978–1983, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. S. K. Khattri and I. K. Argyros, “Sixth order derivative free family of iterative methods,” Applied Mathematics and Computation, vol. 217, no. 12, pp. 5500–5507, 2011. View at Publisher · View at Google Scholar
  14. R. Thukral, “Eighth-order iterative methods without derivatives for solving nonlinear equations,” ISRN Applied Mathematics, vol. 2011, Article ID 693787, 12 pages, 2011. View at Publisher · View at Google Scholar
  15. F. Soleymani and V. Hosseinabadi, “New third- and sixth-order derivative-free techniques for nonlinear equations,” Journal of Mathematics Research, vol. 3, pp. 107–112, 2011. View at Zentralblatt MATH
  16. F. Soleymani and S. Karimi Vanani, “Optimal Steffensen-type methods with eighth order of convergence,” Computers and Mathematics with Applications, vol. 62, no. 12, pp. 4619–4626, 2011. View at Publisher · View at Google Scholar
  17. F. Soleymani, “Two classes of iterative schemes for approximating simple roots,” Journal of Applied Sciences, vol. 11, no. 19, pp. 3442–3446, 2011. View at Publisher · View at Google Scholar
  18. F. Soleymani, “Regarding the accuracy of optimal eighth-order methods,” Mathematical and Computer Modelling, vol. 53, no. 5-6, pp. 1351–1357, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. F. Soleymani, S. K. Khattri, and S. Karimi Vanani, “Two new classes of optimal Jarratt-type fourth-order methods,” Applied Mathematics Letters, vol. 25, no. 5, pp. 847–853, 2012. View at Publisher · View at Google Scholar
  20. F. Soleymani, “Revisit of Jarratt method for solving nonlinear equations,” Numerical Algorithms, vol. 57, no. 3, pp. 377–388, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. D. K. R. Babajee, Analysis of higher order variants of Newton's method and their applications to differential and integral equations and in ocean acidification, Ph.D. thesis, University of Mauritius, 2010.
  22. F. Soleymani, “On a novel optimal quartically class of methods,” Far East Journal of Mathematical Sciences (FJMS), vol. 58, no. 2, pp. 199–206, 2011.
  23. F. Soleymani, S. Karimi Vanani, M. Khan, and M. Sharifi, “Some modifications of King's family with optimal eighth order of convergence,” Mathematical and Computer Modelling, vol. 55, no. 3-4, pp. 1373–1380, 2012. View at Publisher · View at Google Scholar
  24. F. Soleymani and B. S. Mousavi, “A novel computational technique for finding simple roots of nonlinear equations,” International Journal of Mathematical Analysis, vol. 5, pp. 1813–1819, 2011.
  25. F. Soleymani and M. Sharifi, “On a class of fifteenth-order iterative formulas for simple roots,” International Electronic Journal of Pure and Applied Mathematics, vol. 3, pp. 245–252, 2011.
  26. L. D. Petković, M. S. Petković, and J. Džunić, “A class of three-point root-solvers of optimal order of convergence,” Applied Mathematics and Computation, vol. 216, no. 2, pp. 671–676, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  27. X. Wang and L. Liu, “New eighth-order iterative methods for solving nonlinear equations,” Journal of Computational and Applied Mathematics, vol. 234, no. 5, pp. 1611–1620, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  28. B. I. Yun, “A non-iterative method for solving non-linear equations,” Applied Mathematics and Computation, vol. 198, no. 2, pp. 691–699, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  29. J. F. Traub, Iterative Methods for the Solution of Equations, Chelsea Publishing Company, New York, NY, USA, 1982.