An Efficient Family of Optimal Eighth-Order Iterative Methods for Solving Nonlinear Equations and Its Dynamics

Abstract

The prime objective of this paper is to design a new family of optimal eighth-order iterative methods by accelerating the order of convergence of the existing seventh-order method without using more evaluations for finding simple root of nonlinear equations. Numerical comparisons have been carried out to demonstrate the efficiency and performance of the proposed method. Finally, we have compared new method with some existing eighth-order methods by basins of attraction and observed that the proposed scheme is more efficient.

1. Introduction

One of the prominent iterative methods for finding simple roots of a nonlinear equation, , is Newton’s method which is described as follows: It is well known that the order of convergence of Newton’s method is two. Solving a nonlinear equation is one of the most important and challenging tasks in numerical analysis. The vast literature is available for computing the solution of nonlinear equations or system of nonlinear equations; for instance, one can see [1–7]. During the last few years, multipoint methods have drawn the attention of many researchers. In [5] Petkovic et al. have presented a large collection of with and without memory multipoint methods for solving nonlinear equations. In the recent past, researchers have focused to optimize the existing methods without additional evaluation of function and derivative. In [8] Chun et al. have introduced the method of choosing weight functions in iterative methods for simple root. Recently, Soleymani and Mousavi [9] introduced the following seventh-order method: where and , ; , , , . To compare the efficiency of different iterative methods the efficiency index is defined by , where is the order of convergence and is the number of total function and derivative evaluations per iteration [7]. According to the conjecture of optimality, the optimal order of any multipoint iterative method without memory is given by where is the total number of function evaluations [4]. Thus, the efficiency index of the method (2) is . Also, this method is not optimal, because this method requires four evaluations (three functions and one derivative) and for optimal its order should be . The aim of this paper is to accelerate the order of convergence of the method (2) from seven to eight without adding more evaluations. Thus, it will agree with Kung-Traub conjecture as well as has higher efficiency index.

The rest of the paper is organized as follows: in Section 2, we propose a new family of optimal eighth-order iterative method for finding simple root of nonlinear equations. In Section 3, we employ some numerical examples to compare the performance of our new method with some existing eighth-order methods. Section 4 is devoted to the dynamical comparisons by basins of attraction in the complex plane of our proposed method with some existing methods. Finally, in the last section we give the conclusion.

2. Improved Scheme and Convergence Analysis

In this section, the order of convergence of the method (2) will be improved. The order of convergence of the method (2) is seven by using four evaluations [, , , ], which is clearly not optimal. To build an optimal eighth-order method without using more evaluations, we consider where , , , and . The weight functions should be chosen such that the order arrives at optimal level eight. Theorem 1 gives the conditions on weight functions to reach at the optimal order of convergence.

Theorem 1. Let the function has sufficient number of continuous derivatives in a neighborhood of simple root of . Then the method described by (3) has eighth-order convergence, provided the weight functions , , , , and satisfy the following conditions:

Proof. Let be the error in the iterate and , . We provide Taylor’s series expansion of each term involved in (3). By Taylor expansion around the simple root in the iterate, we have From (5) and (6), it can be easily found that By considering this relation and , we obtain Taylor’s expansion of around the root is given as In view of (5) and (9), we get Using (9), (10), (11) and , , , in the second step of (3), we find By virtue of the above equation, we have With the help of the above expression, one can derive Finally, using (10), (15), (16), (12), (13), (14) and , , , , , , , in the last step of (3), we get the final error expression which is given by Thus, theorem is proved.

Particular Case. Let where , , , and ; then the method becomes where , , , and . Then its error expression becomes

Remark 2. By taking different values of , , , and one can get a number of eighth-order iterative methods. Clearly its efficiency index is which is more than of the method (2).

3. Results and Discussion

This section deals with the numerical comparisons of the proposed method (19). We have taken four particular cases of the proposed method (19) by considering different values of , , , and . The result of the comparisons of these methods based on the dynamical behavior is given in Table 4. From Table 4, we found that for , , and method is more efficient than the other ones. In order to check the effectiveness of the proposed iterative method we have considered seven test nonlinear functions which are taken from [10]. The test nonlinear functions and their roots are listed in Table 1. In recent days, higher-order methods are very important because numerical applications use high precision computations. Due to this reason all the computations reported have been performed on the programming package using digits floating point arithmetic using “SetAccuraccy” command. The results of the comparisons are given in Tables 2 and 3. The Computer characteristics during numerical calculations are Microsoft Windows 8 Intel Core i5-3210M CPU@ 2.50 GHz with 4.00 GB of RAM, 64-bit Operating System throughout this paper. Here, we compare the performance of our new eighth-order method () with the methods (34) (), (35) () of [11]; NM2 (), NM3 () of [12]; (11) (), (15) () of [10]. Table 2 represents the value of calculated for the total number of function evaluations twelve (TNFE-12) for each scheme. Table 3 exhibits the number of iterations and total number of function evaluations using the stopping criteria where . It can be observed from Tables 2 and 3 that our method is competitive.

Table 1 

Functions and their roots.

Table 2 

Comparison of absolute value of the functions after third iteration.

Table 3 

Comparison of number of iterations and total number of function evaluations.

Table 4 

Comparison of dynamical behavior of our proposed method for different values of the parameters , , , and .

4. Dynamical Analysis

In this section, we study the dynamic comparison of some higher-order simple root methods in the complex plane using basins of attraction. The basin of attraction is a way to view how an algorithm behaves as a function of the various starting point. It is an another way to compare the iterative methods. Recently, different iterative methods have been compared by their basins of attraction in [13–17]. In order to compare these methods we consider a rectangle and assign a color to each point , according to the root at which the corresponding iterative method starting from converges, and we mark the point as black if the method does not converge. We have used stopping criteria and maximum number of iterations for each method. In this section, the following test polynomials and nonpolynomials have been considered for comparison:(i)(ii)(iii)(iv).

Here, we try to find the optimal value of the parameters used in the proposed method (19). In order to obtain the optimal value, we have given rank 1 for best and rank 4 for the worst performance in each polynomial. The average value of the ranks for each method has been mentioned in Table 4. The method with least average value will be the best performer. In Figure 1, it can be easily observed that for polynomial (i) the dynamical behavior of the method is superior than the methods , , and . So, we have given rank 1 to method and rank 2 to method . The method is slightly better than so we have assigned rank 3 to method and rank 4 to method .

(a)

(b)

(c)

(d)

Figure 1 

Basins of attraction for polynomial .

Based on Figure 2, for polynomial (ii) again is best, followed by method . The methods and have given the rank 1 and 2, respectively. The behavior of methods and is almost similar with rank 3.

(a)

(b)

(c)

(d)

Figure 2 

Basins of attraction for polynomial .

According to Figure 3, and have been given the ranks 1 and 2, respectively, for nonpolynomial (iii). Methods and are given the ranks 3 and 4, respectively.

(a)

(b)

(c)

(d)

Figure 3 

Basins of attraction for non-polynomial .

From Figure 4, it can be seen that again is best with rank 1. Method has rank 2. The dynamical behaviors of methods and have rank 3 due to their almost similar basins of attraction.

(a)

(b)

(c)

(d)

Figure 4 

Basins of attraction for nonpolynomial .

Finally, from Table 4 we observe that the average rank for the method is minimum. The method is better than others in terms of less chaotic behavior and large basins of attraction for finding the solutions. Hence, we will consider it for comparison with some other well established existing eighth-order methods.

Polynomial (i), has roots , , , and . According to Figure 5, we found that is best and other methods , , , and do not perform well. Methods and show chaotic behavior. Polynomial (ii) has roots , , and . According to Figure 6, we found that is best and other methods , , , and do not perform well. Again methods and show chaotic behavior.

(a)

(b)

(c)

(d)

(e)

(f)

(g)

Figure 5 

Basins of attraction for polynomial .

(a)

(b)

(c)

(d)

(e)

(f)

(g)

Figure 6 

Basins of attraction for polynomial .

Nonpolynomial (iii) has roots , , and . Based on Figure 7, we observe that method dominates other methods.

(a)

(b)

(c)

(d)

(e)

(f)

(g)

Figure 7 

Basins of attraction for nonpolynomial .

Nonpolynomial (iv) has roots , , and . In Figure 8, again performs better than other methods. Methods , , , , , and have large number of diverging points (black points).

(a)

(b)

(c)

(d)

(e)

(f)

(g)

Figure 8 

Basins of attraction for nonpolynomial .

In this section, we observe that some schemes have simple boundary of basins and other have complex boundary of basins. We also found that some existing iterative methods have chaotic behavior. Based of Figures 5, 6, 7, and 8 we also observe that methods , , , , , and have more diverging points (black area) in comparison with . Finally, our method has less number of diverging points and large basins of attraction.

5. Conclusion

In this paper, we have developed a new family of optimal eighth-order iterative methods to find simple root of nonlinear equations. New proposed family is obtained by improving the order of convergence of the existing seventh-order method without adding more evaluations and using the weight function technique. Numerical and dynamical comparisons have also presented to show the performance of the new method. From numerical and graphical comparisons, we can conclude that the new family is efficient and give tough competition to some existing eighth-order methods.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

The authors are highly grateful to the reviewers for their precious suggestions, in improving the quality and presentation of the original paper.