Professional Documents
Culture Documents
1
Department of Mathematics, Faculty of Science
Universiti Putra Malaysia
43400 UPM Serdang, Selangor, Malaysia
2
School of Mathematical Sciences, Faculty of Science and Technology
Universiti Kebangsaan Malaysia
43600 UKM Bangi, Selangor, Malaysia
n izaruedge@yahoo.com
Abstract
An improved parameter regula falsi method p(l)-RF based on a di-
rect generalization of the interval parameter regula falsi p-RF method
is proposed in this paper. This method is modified by using the mid-
point of the current interval in the algorithm and the additional inner
iterations l to improve its rate of convergence. This modification on
p-RF method is then verified on several test examples. Based on the
numerical results and CPU time of p(l)-RF method, it is very clear that
this method performs very well compared to the original method.
1 Introduction
Apart from iterative procedures, the main tool to be used in this paper is inter-
val analysis based upon the very simple idea of enclosing the zero of a function.
Researchers such as [5] and [2] have shown that the iterative procedures which
involved interval analysis approach is much convenience because the nal in-
terval of the iterative procedure always contain the zero of the function. In
other word, the zero is always bounded in the interval.
1348 N. A. Bakar, M. Monsi and N. Hassan
2 p-RF Algorithm
The following is the algorithm for p-RF method [4].
(0) (0) (k+1)
(k+1)
Step 0 : Given that: X (0) = x1 , x2 ; X (0) ; d X (k+1) = x2 x1
with conditions
(k+1,i) z (i) x(k) (i)
X = z (i) f (z )+
f (z ) f (x )
(i) (k)
1 (k+1,i1) (i)
(k+1,i1) (k)
(k+1,i1)
K X z X x X
2
if f x(k) = 0. Otherwise, X (k+1,i) = X (k+1,i1)
X (k) , k0
and
(p) (k1)
d X (k+1) d X (k) d X ; ( 0)
where d X (k+1) , d X (k) , and d X (k1) are the width of the intervals
X (k+1) , X (k) and X (k1) respectively. Then the R-order of convergence of p-
RF satises the inequality
1
OR ((p RF) , ) p + p2 + 4 (3)
2
The proof of these theorem is available in [4].
Step 2 : x(k) = m X (k) (midpoint of X (k) )
(k)
f x
(k)
Step 3 : X (k+1) = x(k) X
H
Step 4 : k := k + 1
Step 5 : x(k) = m X (k)
(k)
f x
(k)
Step 6 : X (k+1,i2) = x(k) X
H
Step 7 : Compute
x(k) x(k1)
X (k+1,i1)
= x(k) f (x(k) )+
f (x(k) ) f (x(k1) )
1 (k+1,i2) (k)
(k+1,i2) (k1)
(k+1,i2)
K X x X x X
2
if f x(k) = 0. Otherwise, X (k+1,i1) = X (k+1,i2)
Step 8 : z (i) = m X (k+1,i1) and z (i1) = m X (k+1,i2)
Step 9 : Compute
z (i) z (i1) (i)
X (k+1,i) = z (i) f (z )+
f (z (i) ) f (z (i1) )
1 (k+1,i1) (i)
(k+1,i1) (i1)
(k+1,i1)
K X z X z X
2
if f z (i) = 0. Otherwise, X (k+1,i) = X (k+1,i1)
Step 10 : If d X (k+1,i) < , go to 18
Step 11 : If i < p then i := i + 1 and go to 8
Step 12 : X (k+1) = X (k+1,p) = X (k+1,p,l1)
Step 13 : Compute
(k+1,p,l) (l) z (l) z (l1) (l)
X = z f (z )+
f (z (l) ) f (z (l1) )
1 (k+1,p,l1) (l)
(k+1,p,l1) (l1)
(k+1,p,l1)
K X z X z X
2
(l)
if f z = 0. Otherwise, X (k+1,p,l) = X (k+1,p,l1)
Step 14 : If d X (k+1,p,l) < , go to 18
Step 15 : If l < p then l := l + 1 and go to 13
Step 16 : X (k+1) = X (k+1,p,p)
Step 17 : If d X (k+1) > , go to 4
Step 18 : Stop.
An improved parameter regula falsi method 1351
Not only that, we also introduce another inner iteration, l (l 2). This
iteration process from l = 2, 3, . . . , p takes place after the computation of inner
iteration i nished. Then, we substitute the latest interval that is X (k+1,p)
with X (k+1,p,l). Readers can track down the modication that we have done
by comparing algorithm on Section 2 and Section 3.
where (p 2) ; (1 l p) or
1 2
OR ((p(l) RF ) , ) (2p + (l 2)) + (2p + (l 2)) + 4 .
2
Proof. :
Of (4), (5) and (6) : Can be found in [4].
Of (7) : The proof of
(k+1,1) 1 K (k) (k1)
d X d X d X ,
4 H
can be found in [4]. Next, we have
(k+1,2) (2) z (2) z (1) (2)
d X d z f z +
f (z (2) ) f (z (1) )
1 (k+1,1) (2)
(k+1,1) (1)
K X z X z
2
z (2) z (1) 1 (k+1,1) (2)
(k+1,1) (1)
= d K X z X z .
f (z (2) ) f (z (1) ) 2
z (2) z (1) 1 1
By = (f ( )) ( X), it follows that
f (z ) f (z )
(2) (1) H
(k+1,2) 1 (k+1,1) (2)
(k+1,1) (1)
d X d K X z X z
2H
1 (k+1,1) (2)
(k+1,1) (k)
(k) (1)
= d K X z X x + x z .
2H
By d (AB) d (A) |B| + |A| d (B) [4] we have
(k+1,2) 1 (k+1,1) (2)
(k+1,1) (k)
(k)
(1) 2
d X d K X z X x + x z
2H
1 K (k+1,1) (2)
(k+1,1) (k)
(k)
(1) 2
d X z X x + x z .
2 H
Again, we use d (AB) d (A) |B| + |A| d (B) and we have
(k+1,2) 1 K (k+1,1) (2)
(k+1,1) (k)
(k)
(1) 2
d X d X z X x + x z
2 H
K (k+1,1) (k+1,1) (k)
(1) 2
+ X (2)
z d X x (k)
+ x z
H
1 (k+1,1) (k+1,1)
(2) K
K
d X z
+ X z d (2)
2 H H
(k+1,1) 2
X x(k) + x(k) z (1) +
K (k+1,1) (k) (k)
(k) 2
X z (2)
d X X (k)
+ X X .
H
An improved parameter regula falsi method 1353
K K
By using d and the fact that d ((X x)n ) 2 (d (X))n , we have
H H
(k+1,2) 1 (k+1,1) K (k+1,1) K
d X 2 d X + X z
(2)
2 H H
(k+1,1) 2 K
X x(k) + x(k) z (1) + X (k+1,1) z (2)
H
(k) (k) (k) 2
(k)
d d X ,d X + d X ,d X .
(k+1,2) 1 (k+1,1) K (k+1,1) K
d X 2 d X + X z
(2)
2 H H
(k+1,1) 2 K
X x(k) + x(k) z (1) + X (k+1,1) z (2)
H
(k) (k) 2
d 2d X , 2d X .
(k+1,2) 1 K (k+1,1) K (k+1,1)
d X
2 d X
+ X z (2)
2 H H
(k+1,1) (k) 2 K (k+1,1)
X x + x z + X
(k) (1)
z (2)
H
(k) (k) (k)
2 2d X , 2d X 4d X .
By using X (k) x(k) d X (k) and x(k) z (1) d X (k) , we then have
(k+1,2) 1 K (k+1,1) K (k+1,1)
d X 2 d X + X X (k+1,1)
2 H H
(k)
X X (k) + d X (k) 2 +
K (k+1,1) (k) 2
X X (k+1,1)
16 d X
H
1 K (k+1,1) K (k+1,1)
2 d X
+ d X
2 H H
(k) (k) 2 K (k+1,1) (k) 2
d X +d X
+ d X 16 d X
H
1354 N. A. Bakar, M. Monsi and N. Hassan
Therefore,
(k+1,2) K 2
d X 14 d X (k+1,1) d X (k)
H
K 1 K (k) (k1) (k) 2
= 14 d X d X d X
H 4 H
2
(k+1,2) 7 K (k) 3 (k1)
d X d X d X
2 H
with
(i1) i
7 K
i = , i = 1, 2, . . . , p.
2 H
(k+1,p,2) z (l) z (l1) (l)
d X d z (l) f z +
f (z ) f (z
(l) (l1) )
1 (k+1,p,1) (l)
(k+1,p,1) (l1)
K X z X z .
2
By using the same approach as above, then we will get the following result
(k+1,p,2) K
d X 4 d X (k+1,p,1) d X (k)
H
p1 p
K 7 K (k) 2p1 (k1) (k)
= 4 d X
H d X d X
H 2
p1 p+1
7 K
= 4 d X (k) 2p1+1 d X (k1) .
2 H
or we can write it as
(k) 2p+(l2) (k1)
d X (k+1,p,l) l1
p d X d X
where
p1 p+(l1)
7 K
pl1 =4 (l1) , 2 l p.
2 H
where
p1 p+(l1)
7 K
pl1 =4 (l1) , 2 l p.
2 H
Therefore, based on this result and [4] the R-order of convergence of p(l)-RF
method is
1 2
OR ((p(l) RF) , ) (2p + (l 2)) + (2p + (l 2)) + 4
2
1356 N. A. Bakar, M. Monsi and N. Hassan
where p 2, 2 l p.
If we compare the R-order of convergence of p(l)-RF method and p-RF
method, so it is clear that p(l)-RF method is more eective. Let p = 5, then
lets substitute the value of p into (3) rst. Hence,
1
OR ((p RF) , ) p + p2 + 4
2
1
= 5 + 52 + 4
2
1
= 5 + 29
2
1
OR ((p RF) , ) 5 + 29 .
2
Next, substituting p = 5 into (3) gives
1 2
OR ((p(l) RF) , ) (2p + (l 2)) + (2p + (l 2)) + 4
2
1 2
= (2(5) + (l 2)) + (2(5) + (l 2)) + 4
2
1 2
= (8 + l) + (8 + l) + 4
2
1 2
OR ((p(l) RF) , ) (8 + l) + (8 + l) + 4 .
2
5 Numerical Results
We now compare the performance of p(l)-RF method with p-RF method. The
comparisons are based on the CPU (Central Processing Unit) time and number
of iterations which are presented in Table 1 and Table 2 respectively. The
following table contains the test functions used to test the performance of
both methods where the zero of each function contain in the nal interval.
We also present the nal interval results that contain the zeros of the functions
6 and 7 produced by p-RF method and p(l)-RF method in Table 3 and Table
4 respectively. The stopping criterion used is d X (k+1) < = 1015 for p = 5
and 2 l 5. The procedure p-RF and p(l)-RF have been implemented using
Matlab R2007a [1] in associate with Intlab [12].
An improved parameter regula falsi method 1357
Furthermore, Table 3 and Table 4 are the computer output of the functions
6 and 7 respectively. It is clear that p(l)-RF method has achieved excellent
performance where the algorithm of p(l)-RF is terminated earlier by using
the same convergence criterion. In fact, we have shown that the R-order of
convergence of p(l)-RF method is greater than does p-RF method or
7 Acknowledgement
We are indebted to Universiti Kebangsaan Malaysia for funding this research
under the grant UKM-GUP-2011-159.
References
[1] A. Gilat, MATLAB: An introduction with applications, Hobuken,
NJ:Wiley, 2008.
[3] F. Costabile, M.I. Gualtieri, S.S. Capizzano, An iterative method for the
computation of the solution of nonlinear equations, Calcolo, 36 (1999),
17-34.
[6] J. Kou and Y. Li, An improvement of the Jarrat method, Applied Math-
ematics and Computation,189 (2007), 1816-1821.
[7] K. Wang & X. Feng, New predictor corrector methods of second-order for
solving nonlinear equations, International Journal of Computer Mathe-
matics, Vol.88,2 (2011), 296-313.
[9] N.A. Bakar, M. Monsi, M.A. Hassan, W.J. Leong, On The Modication
of The p-RF Method, Applied Mathematical Sciences, 5 (2011), 2571 -
2579.
[10] P.K. Parida, & D.K. Gupta, A cubically convergent iteration method for
multiple roots of f (x) = 0, International Journal of Computer Mathemat-
ics, Vol.87,3 (2010), 877-884.
[11] S.A. Hoda Ibrahim, An improved exponential regula falsi methods with
cubic convergence for solving nonlinear equations, J. Appl. Math. & In-
formatics, 28 (2010), 1467-1476.