NEW FAMILY OF ITERATIVE METHODS FOR SOLVING NON-LINEAR EQUATIONS USING NEW ADOMIAN POLYNOMIALS
NEW FAMILY OF ITERATIVE METHODS FOR SOLVING NON-LINEAR EQUATIONS USING NEW ADOMIAN POLYNOMIALS
The Pure and Applied Mathematics. 2015. Aug, 22(3): 231-243
• Received : January 28, 2015
• Accepted : June 29, 2015
• Published : August 31, 2015 PDF e-PUB PubReader PPT Export by style
Article
Author
Metrics
Cited by
TagCloud
Arif, Rafiq
Ayesha Inam, Pasha
Byung-Soo, Lee
DEPARTMENT OF MATHEMATICS, KYUNGSUNG UNIVERSITY, BUSAN 608-736, KOREAEmail address:bslee@ks.ac.kr

Abstract
We suggest and analyze a family of multi-step iterative methods for solving nonlinear equations using the decomposition technique mainly due to Rafiq et al.  .
Keywords
1. INTRODUCTION
In recent years, much attention has been given to develop several iterative methods for solving nonlinear equations (see for example [1 , 6 - 12 , 14] ). These methods can be classified as one-step and two-step methods.
Abbasbandy  and Chun  have proposed and studied several one-step and two-step iterative methods with higher order convergence by using the decomposition technique of Adomian  .
In  , Noor developed two-step and three-step iterative methods by using the Adomian decomposition technique and by combining the well-known Newton method with other one-step and two-step methods.
In [1 , 11 - 12] , the authors have used the higher order derivatives which is a drawback. To overcome this drawback, following the lines of  , we suggest and analyze a family of multi-step iterative methods which do not involve the high-order derivatives of the function for solving nonlinear equations using the decomposition technique mainly due to Rafiq et al.  . We also discuss the convergence of the new proposed methods. Several numerical examples are given to illustrate the efficiency and the performance of the new iterative method. Our results can be considered as an improvement and refinement of the previous results.
2. ITERATIVE METHODS
Consider the nonlinear equation PPT Slide
Lager Image
We assume that α is a simple root of (1) and β is an initial guess sufficiently close to α . We can rewrite (1) as a coupled system using the Taylor series. PPT Slide
Lager Image PPT Slide
Lager Image
We can rewrite (3) in the following form as PPT Slide
Lager Image
We can rewrite (4) in the following equivalent form as PPT Slide
Lager Image
where PPT Slide
Lager Image
and PPT Slide
Lager Image
In order to prove the multi-step iterative methods, He  and Lao  have considered the case with the definition that PPT Slide
Lager Image
and Noor and Noor  have considered the case PPT Slide
Lager Image
which is actually PPT Slide
Lager Image
and is the stronger one. We rectify this error and also remove such kind of conditions. For this purpose, we substituting (3) into (7) to obtain PPT Slide
Lager Image
with PPT Slide
Lager Image
We now construct a new family of iterative methods by using the following decomposition method mainly due to Rafiq et al.  . This decomposition of the nonlinear operator N ( x ) is quite different than that of Adomian decomposition. The main idea of this technique is to look for a solution of (5) having the series form PPT Slide
Lager Image
The nonlinear operator N can be decomposed as PPT Slide
Lager Image
where Ai are the functions which are known as the new Adomian polynomials depending on x 0 , x 1 , ⋯ ; given by a formula PPT Slide
Lager Image
First few new Adomian polynomials are as follows PPT Slide
Lager Image
Substituting (12) and (13) into (5), we obtain PPT Slide
Lager Image
It follows from (6), (12) and (17), that PPT Slide
Lager Image
This allows us to suggest the following one-step iterative method for solving (1).
Algorithm 1.
For a given x 0 , compute the approximate solution x n+1 by the iterative scheme PPT Slide
Lager Image
which is known as “ Newton’s Method ” and it has the second order convergence .
From (10) and (17), we have PPT Slide
Lager Image
Again using (12), (15), (16), (17) and (18) , we conclude that PPT Slide
Lager Image
Using this relation, we can suggest the following two-step iterative methods for solving (1).
Algorithm 2.
For a given x 0 , compute the approximate solution x n+1 by the iterative scheme
Predictor-Step PPT Slide
Lager Image
Corrector-Step PPT Slide
Lager Image
This Algorithm is commonly known as “ Double-Newton Method ” with the third order convergence .
Again PPT Slide
Lager Image
From (11), (17)-(21), we conclude that PPT Slide
Lager Image
Using this, we can suggest and analyze the following two-step iterative method for solving (1).
Algorithm 3. (AP)
For a given x 0 , compute the approximate solution x n+1 by the iterative scheme
Predictor-Step PPT Slide
Lager Image
Corrector-Step PPT Slide
Lager Image
Algorithm 3 is called the two-step iterative method for solving (1).
Again using (11) and (16), we have PPT Slide
Lager Image
From (11), (18) – (20), we have PPT Slide
Lager Image
Using this, we can suggest and analyze the following iterative method for solving (1).
Algorithm 4.
For a given x 0 , compute the approximate solution x n+1 by the iterative scheme
Predictor-Step PPT Slide
Lager Image
Corrector-Step PPT Slide
Lager Image
If f' ( yn ) = 0 then Algorithm 3 reduces to the following method PPT Slide
Lager Image
Now using finite difference approximation, we obtain PPT Slide
Lager Image
Combining (22) and (24), we suggest the following new iterative method for solving (1) as follows PPT Slide
Lager Image
Also we can suggest and analyze the following iterative method for solving (1).
Algorithm 5. (A)
For a given x 0 , compute the approximate solution x n+1 by the iterative scheme
Predictor-Step PPT Slide
Lager Image
Corrector-Step PPT Slide
Lager Image
3. CONVERGENCE ANALYSIS
Theorem 1. Let β I be a simple zero of sufficiently differentiable function f : I ⊆ ℝ → ℝ for an open interval I . If x 0 is sufficiently close to β , then the two-step iterative method defined by Algorithm 3 has the fourth-order convergence .
Proof . Let β I be a simple zero of f . Since f is sufficiently differentiable function, by expanding f ( xn ) and f' ( xn ) about β , we get PPT Slide
Lager Image PPT Slide
Lager Image
where PPT Slide
Lager Image
, k = 1, 2, 3, · · · and en = xn β .
Now from (27) and (28), we have PPT Slide
Lager Image
From (18) and (29), we get PPT Slide
Lager Image
Now expanding f ( yn ) about β , we have PPT Slide
Lager Image
From (28) and (31), we have PPT Slide
Lager Image
Now expanding f' ( yn ) about β and using (32), we have PPT Slide
Lager Image
From (31) and (34), we get PPT Slide
Lager Image
From (29) and (35), we have PPT Slide
Lager Image
From (22), (32) and (35), one obtains PPT Slide
Lager Image
Hence it is proved.                                                                                          ☐
Theorem 2. Let β I be a simple zero of a sufficiently differentiable function f : I ⊆ ℝ → ℝ for an open interval I . If x 0 is sufficiently close to β , then the iterative method defined by Algorithm 4 has the fourth- order convergence .
Proof. From (28) and (33), we have PPT Slide
Lager Image
From (35) and (37), we get PPT Slide
Lager Image
From (23), (32), (35) and (38), one obtains PPT Slide
Lager Image
Hence it is proved.                                                                                           ☐
Theorem 3. Let β I be a simple zero of a sufficiently differentiable function f : I ⊆ ℝ → ℝ for an open interval I . If x 0 is sufficiently close to β , then iterative method defined by Algorithm 5 has the third- order convergence .
Proof . From (27) and (31), we have PPT Slide
Lager Image
From (32) and (40), we get PPT Slide
Lager Image
From (26), (30), (32) and (41), one obtains PPT Slide
Lager Image
Hence it is proved.                                                                                           ☐
4. NUMERICAL EXAMPLES
We provide some examples to illustrate the efficiency of the new developed iterative methods. Put ϵ = 10 −15 .
The following stopping criteria is used for the computer programs
• (1) |xn+1−xn| <ϵ,
• (2) |f(xn+1)| <ϵ.
The examples are the same as in Chun  :
• F1(x) =sin2x−x2+ 1,
• F2(x) =x2−ex− 3x+ 2,
• F3(x) =cosx−x,
• F4(x) = (x− 1)3− 1,
• F5(x) =x3− 10,
• F6(x) =x·ex2−sin2x+ 3cosx+ 5,
• F7(x) =ex2+7x−30− 1.
Also for the convergence criteria, it was required that the distance of two consecutive approximations δ for the zero was less than 10 −15 . Also displayed are the number of iterations (IT) to approximate the zero, the approximate zero x 0 , the value f ( x 0 ) and δ . We compare the Newton method (NM), the Double Newton method (DNM), the method of Noor (NR)  and the method (AP) , introduced in the Algorithm 3 (see Table 1 ). PPT Slide
Lager Image
Now we compare the Newton method (NM), the Double Newton method (DNM), the method of Weerakoon and Fernando  , the method of Frontini and Sormani  , the method of Homeier  , the method of Noor (NR)  and the method (A), introduced in the Algorithm 5 (see Table 2 ). PPT Slide
Lager Image
5. CONCLUSION
We have suggested a family of two-step iterative methods for solving nonlinear equations by using a new decomposition technique mainly due to Rafiq et al.  . It is important to note that the implementation of these methods does not require the computation of higher order derivatives compared to most other methods of the same order.
2010 Mathematics Subject Classification. 26A18, 39B12.
References