Received 17 January 2016; accepted 21 March 2016; published 24 March 2016
In the real world, many of the complex problems after simplification lead to solving nonlinear problems. Find an approximation of the simple roots of the equations is one of the important problems on this issue. The rapid development of technology has led to different of algorithms. Over time, many algorithms have been developed. In this state, one of the ways for comparison of different algorithms is finding of complexity of time and index efficiency of algorithms. MAPLE software is one of the powerful algebraic systems from Maplesoft company, such that in this article it has been used for the calculation. The boundary value problems appearing in kinetic theory of gases, elasticity and other applied areas are reduced to solve these equations. Many optimization problems also lead such equations. Hence, one of the most important problems in numerical analysis is to find a simple root a of a nonlinear equation, where for an open interval is a scalar function. In this study, in order to find a, we should start with an initial approximation which is near to the root and generates successive iterates converging to simple root a of nonlinear equation. In all iteration, the improved method requires three evaluations of the function and two evaluations of the first order derivatives of function. Therefore, the modified method has the efficiency index. The numerical examples show that, the proposed method has more efficient with respect to the Newton method and other methods in this class. The effectiveness of the modified ninth-order method will be examined by approximation the simple root of a given non-linear equation. The suggested method is comparable to the sixth-order methods   ; also the eighth-order methods  and  .
In the reminder, we proceed as follows: In Section 2, we recall the basic concepts. The proposed method is described in Section 3. In Section 4, the convergence analysis is carried out to establish the ninth-order of convergence of our method. In Section 5, as is shown in the numerical examples, this method is more efficient than Newton method and other methods of lower or same order. We conclude with some remarks on the presented approaches in Section 6.
2. Several Basic Definitions
Our goal is to find the value of x that satisfies the following equation.
where is a nonlinear equation. The value of x that satisfies (1) is called a root of and denoted by a. Therefore, the procedure used of to find x is called root-finding. Let a is a simple root of Equation (1) and is a real sequence.
Definition 1. See  : The sequence is said to converge to a if
Furthermore, if there exists positive constant c and p such that:
we say that converges to a of order p. Larger values of p correspond to faster convergence. Let be error in the nth iterate of the method which produces the sequence. The relation
is called the error equation. The value of p is called the order of convergence of method, see  .
Definition 2. Let a be a root of the function f and suppose that, and are three consecutive iterations closer to the root a. The the computational order of convergence can be approximated using the formula:
3. New Proposed Scheme
The new method is based on  method. With a simple manipulation, and a new approach to get the following equations.
This is four-step method. It is not necessary to compute the first-order derivative at the point since a good approximation can be obtained. In order to approximate use the linear interpolation on two points and, so we have:
Now using Equations (2), we have:
Substituting the relation of (6) into the relation (3), in this case, we obtain the following formula:
Obviously this method requires evaluations of three function f and two derivatives.
4. Convergence Analysis
To determine order of convergence of proposed method, we must be solving integer nonlinear programming as follow:
where C is a special coefficient of. This is equivalent to the bellow theorem, i.e. we show that the convergence of the proposed method is of the order of 9.
Theorem 1. Let has continuous derivative function and is a simple root of f. If the initial point is sufficiently close1 to a, then the method defined by (2) converges to a in the ninth-order. Furthermore, the error in the method given by (2) satisfies the equation:
where and for.
Proof. Let be the error term in the iterate. Using Taylor expansion, we have:
Quotient relations (9) and (10), gives the following results:
Thus we have
Taylor expansion of the function around the point a to get the following result (i.e (11)):
Substituting (9), (10) and (11) into the zn section of the Equation (2), we have:
Furthermore, the Taylor expansion of about a is
Since from (10), (12) and (13) we get:
Again, using the Taylor expansion of function about the point a, in this case we have:
Taylor expansion of the function around the point a to get the following result (i.e (16)):
In this case, using the above result (i.e (15), (16) and (14)) and corresponding to the relation (3), we get:
Therefore, we have:
Thus, the ninth order of convergence of the method is established.
In order to demonstrate the performance, accuracy and effectiveness of the proposed ninth-order method, we take 12 special nonlinear equation test problems from   and  . We compare the proposed method with Wang-Liu’s third-order method  , Weerakoon-Fernando and Parhi-Gupta’s sixth-order methods   and Kou et al. and Neta’s eight-order methods as  and  , respectively. The computing results displayed in Tables 1-5. In every problem we try to seek an approximation of the root a of Equation (1) after n times
Table 1. Comparison of result of proposed method (PM) with Kou and Li (KL) method.
Table 2. Comparison of result of proposed method (PM) with Parhi and Gupta (PG) method.
Table 3. Comparison of result of proposed method (PM) with Neta (NM) method.
Table 4. Comparison of result of proposed method (PM) with Thaukral (TM) method.
Table 5. Comparison of result of proposed method (PM) with Mir (MM) method.
iteration. In this paper, the stoping criterion is. the Run time and the Number of function evaluations (NFE) are also given in Tables 1-5. “DIV” in the tables implies that the corresponding method is diverges. Furthermore, a comparison of the rate of convergence of the proposed method and Kou-Li method  for function at point is shown in Figure 1. The comparison is clearly marked on Figure 1. It should be noted that, Numerical computations reported here have been carried out in the MAPLE 18 environment. The results show that the speed of convergence in all methods discussed in this article, are depends on proper selection of the initial point. For example, in Table 1 for, choose an initial point is leading to the divergence of Kou et al. method, whereas the choose the initial point in the same method is leading to the coverage to the simple root a, see Table 1. In all examples, it is evident that the proposed approach, for any initial point is coverage to simple root of a.
The test functions are listed as follows:
Figure 1. A comparison of the rate of convergence of the proposed method and Kou et al. method for function at point. The proposed and Kou et al. methods converged to the simple root in 3 and 433 iteration, respectively. This show that the PM method is vary faster with respect to the Kou et al. method. More details are given in Table 1.
One can easily see from Tables 1-5 that our method behaves either similarly or better then the compared methods. The results show that the new method has advantages over the Kou et al.  method and the eight-order method as Thukral  method. Also, the new method have iteration stabilities to the original iteration value and behave either similarly or better than the methods compared. All numerical results are in accordance with the theory and the basic advantage of the variants of Newton’s method based on means or integration methods that they do not require the computation of second- or higher-order derivatives although they are of ninth order.
In numerical analysis, many methods produce sequences of real numbers, for example the iterative schemes for solving. Sometimes, the convergence of these sequences is slow and their utility in solving practical problems, quite limited. Convergence acceleration methods try to transform a slowly converging sequence into a fast convergent one. Accordingly in this work, a new method has developed. In this study, a new ninth-order method to solve nonlinear equations has been proposed. From numerical examples, it has been observed that the proposed method convergence quickly toward root a is compared to lower order methods. In addition, in practical terms, the method is noticeable. Also, the above-mentioned ninth-order method requires the evaluation of three functions and two first derivatives of the function. Therefore, the new method has the efficiency index. Unlike the other methods, the proposed method converges well when the initial point is at the boot sides of root a. This is obviously clear understood from the examples.
1Since the proposed method in this paper is the revised and generalized form of the Newton method, it consist of common problems in New- ton method such as proper selection of initial point. In order to solve this problem we can use a number of repetitions of ever-convergence methods as Bisection or False-position.
 Weerakoon, S. and Fernando, T.G.I. (2000) A Variant of Newton’s Method with Accelerated Third-Order Convergence. Applied Mathematics Letters, 13, 87-93.
 Wang, X. and Liu, X.P. (2009) Two New Families of Sixth-Order Methods for Solving Non-Linear Equations. Applied Mathematics and Computation, 213, 73-78.
 Kou, J.S., Li, Y.T. and Wang, X.H. (2006) A Medication of Newton Method with Third-Order Convergence. Applied Mathematics and Computation, 181, 1106-1111.