In this paper, we establish two new iterative methods of order four and five by using modified homotopy perturbation technique. We also present the convergence analysis of these iterative methods. To assess the validity and performance of these iterative methods, we have applied to solve some nonlinear problems.

Iterative Methods Homotopy Perturbation Technique Order of Convergence Nonlinear Equations
1. Introduction

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  - . 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  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  ). Suppose that. If for and, then the sequence is of order m.

2. Development of New Methods

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  . 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.  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:

3. Convergence Analysis

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

Numerical comparison
ExamplesFunctional eq.IT
CM5−1.404491648315341226350868178
NR5−1.404491648315341226350868176
J13−1.404491648215341226035086891
J23−1.404491648215341242094290841
S13−1.404491648215341226035086818
S23−1.404491648215341226035086818
CM40.257530285439860760455367304
NR50.257530285439860760455367306
J130.257530285439860760455367304
J230.257530285439860760455367303
S140.257530285439860760455367305
S240.257530285439860760455367305
CM40.7390851332151606416553720870
NR40.739085133215160641655372089
J130.739085133215160641655312087
J230.739085133215160641655312087
S130.739085133215160641655312087
S230.739085133215160641655312087
CM520
NR52.000000000000000000000000008
J142.000000000000000000000000000
J242.000000000000000000000000000
S132.000000000000000000000000000
S232.000000000000000000000000000
CM52.154434690031883721759235667
NR52.154434690031883721759235663
J132.154434690031883721759293567
J232.154434690031883721759293566
S132.1544346900318837217592935665
S232.1544346900318837217592935665
CM83.0000000000000000000000000003
NR73.0000000000000000000000000006
J173.0000000000000000000000000000
J263.0000000000000000000000000377
S133.0000000000000000000000000000
S233.0000000000000000000001629758

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

4. Numerical Tests

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 (S1) and algorithm 4 (S2) in this paper. We shall make comparison with four and fifth order iterative methods established earlier such as the method of Chun (CM)  , the method of Noor (NR)  , the algorithm 2.1 (J1) and algorithm 2.2 (J2) of Javidi  . We use. The following criterias are used for computer programs:

The examples are same as in Chun  and Noor  .

5. Conclusion

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  and Javidi  .

Cite this paper

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

ReferencesAbbasbandy, S. (2003) Improving Newton-Raphson Method for Nonlinear Equations by Modified Adomain Decomposition Method. Applied Mathematics and Computation, 145, 887-893. http://dx.doi.org/10.1016/S0096-3003(03)00282-0Adomain, G. (1989) Nonlinear Atochastic Systems and Applications to Physics. Kluwer Academy Publishers, Dordrecht. http://dx.doi.org/10.1007/978-94-009-2569-4Chun, C. (2005) Iterative Methods Improving Newton’s Method by Decomposition Method. Applied Mathematics and Computation, 50, 1559-1568. http://dx.doi.org/10.1016/j.camwa.2005.08.022Noor, M.A. and Inayat, K. (2006) Three-Step Iterative Methods for Nonlinear Equations. Applied Mathematics and Computation, 183, 322-327. http://dx.doi.org/10.1016/j.amc.2006.05.055Noor, M.A., Inayat, K. and Tauseef, M.D. (2006) An Iterative Method with Cubic Convergence for Nonlinear Equations. Applied Mathematics and Computation, 183, 1249-1255. http://dx.doi.org/10.1016/j.amc.2006.05.133Babolian, E. and Biazar, J. (2002) On the Order of Convergence of Adomain Method. Applied Mathematics and Computation, 130, 383-387. http://dx.doi.org/10.1016/S0096-3003(01)00103-5Daftardar-Gejji, V. and Jafari, H. (2006) An Iterative Method for Solving Nonlinear Functional Equations. Journal of Mathematical Analysis and Applications, 316, 753-763. http://dx.doi.org/10.1016/j.jmaa.2005.05.009Javidi M. ,et al. (2009)Fourth Order and Fifth Order Iterative Methods for Nonlinear Algebraic Equations Mathematical and Computer Modelling 50, 66-71.Kang, S.M., et al. (2013) A New Second Order Iteration Method for Solving Nonlinear Equations. Handawi Publishing Company, Abstract and Applied Analysis, 2013, Article ID: 48706.He, J.H. (1999) Homotopy Perturbation Technique. Computer Methods in Applied Mechanics and Engineering, 178, 257-262. http://dx.doi.org/10.1016/S0045-7825(99)00018-3