Consider the single variable nonlinear equation

Finding the zeros (1) is an interesting and very ancient problem in numerical analysis. Newton and fixed point iterative methods are very old methods for solving nonlinear equations. Newton method is quadratically con- vergent where as fixed point method is linear convergent. Many modifications have been made in Newton’s method to get cubically convergent iterative methods. Many higher order iterative methods have been estab- lished to approximate the solution of (1) by using different techniques including Taylor’s series, quadrature rules, Adomain decomposition, homotopy perturbation, Gejji and Jafari decomposition, Noor decomposition, see the refrences [1] -[8] . Initialty, we do not put any restrictions on the original function f. In fixed point method, we rewrite as where

We shall establish fourth and fifth order iterative methods using modified homotopy perturbation technique. The order of convergence of a sequence of approximation is defined as;

Definition 1 [9] Let the sequence converges to. If there is a positive integer p and real number C such that

Then p is order of convergence.

Theorem 1 (see [6] ). Suppose that. If for and, then the sequence is of order m.

Consider the nonlinear equation

We can rewrite the above equation as

We suppose that is a root of (2) and is initial guess close to. We can rewrite (3) by using Taylor’s expansion as:

where

We can rewrite (4) as

It can be written in the form

where

and

From (5), we see that

We shall decompose the nonlinear operator by using modified homotopy perturbation technique. For this, we construct a homotopy, that satisfies

where p is embedding parameter and m is unknown real number. The embedding parameter p is monotonically increases from zero to unity as the trivial problem

is continuously deformed the original problem

The basic assumption of modified HPM is that the solution x of (10) can be expressed as a power series in p in the following form

The approximate solution of (2) can be obtained as

The convergence of the infinite series (13) has been proved by He [10] . For the application of modified HPM to (2), we can rewrite (10) by expanding into Taylor’s expansion around:

By substituting (13) in (15), we have

.

By equating the coefficients of like powers of p, we have

We find the value of unknown parameter m such that

From (17), we have

By putting value of and in (18) yields

Substitution of (20) in (17) yields

From (19), we get

From (16), we have

when

This formulation allows us to form the following iterative method.

Algorithm 2 For any initial value, we compute the approximation solution, by the iterative method.

which is mainly due to Shin et al. [9] and has quadratic convergence.

When

From this formulation, we suggest the following iterative method.

Algorithm 3 For any initial value, we compute the approximation solution, by the iterative method.

Predictor step:

Corrector step:

When

From this formulation, we suggest the iteration scheme as follows.

Algorithm 4 For any initial value, we compute the approximation solution, by the iterative method.

Predictor step:

Corrector step:

In this section, we present the convergence analysis of algorithm 3 and algorithm 4 established in this paper.

Theorem 5 Let for an open interval I and consider that the nonlinear equation (or) has simple root, where be sufficiently smooth in the neighborhood of the root. If is sufficiently close to then the two-step iterative method defined by algorithm 3 has fourth order convergence.

Proof. Let

Since α is the root of and is the functional equation of, therefore. From (20), using Maple software, we have

Hence, by theorem 1, the algorithm 3 has fourth order convergence.

Theorem 6 Let for an open interval I and consider that the nonlinear equation (or) has simple root, where be sufficiently smooth in the neighborhood of the root. If is sufficiently close to then the two-step iterative method defined by algorithm 4 has fifth order convergence.

Proof. Let

Since α is the root of and is the functional equation of, therefore. From (20), using Maple software, we have

Hence, by theorem 1, the algorithm 4 has fifth order convergence.

In this section, we shall solve some nonlinear equations to illustrate the efficiency of the newly developed fourth and fifth order iterative methods by using algorithm 3 (S₁) and algorithm 4 (S₂) in this paper. We shall make comparison with four and fifth order iterative methods established earlier such as the method of Chun (CM) [3] , the method of Noor (NR) [4] , the algorithm 2.1 (J₁) and algorithm 2.2 (J₂) of Javidi [8] . We use. The following criterias are used for computer programs:

The examples are same as in Chun [3] and Noor [4] .

In this paper, we have developed two new iterative methods of order four and five for the solution of nonlinear equations based on homotopy perturbation method. To derive these iteration schemes, we have used a very simple technique. Convergence analysis is also discussed. To check convergence, performance and validity, we have applied these iterative methods to solve some nonlinear equations. From Table 1, we see the validity and efficiency of these iterative methods as compared with other methods. Thus our newly established iterative methods are interesting and reliable alternative methods of existing methods in literature of order four and order five for solving nonlinear equations under consideration. Also our methods converge faster than existing methods of order four and five such as Noor [4] and Javidi [8] .

MuhammadSaqib,MuhammadIqbal,ShahidAli,TariqIsmaeel,11, (2015) New Fourth and Fifth-Order Iterative Methods for Solving Nonlinear Equations. Applied Mathematics,06,1220-1227. doi: 10.4236/am.2015.68114