Term Paper

of
Numerical Analysis (MTH-204)
“Explain with example that rate of convergence of false position method is faster
than that of the bisection method.”

SUBMITTED TO: -
Miss.Deepika

-:ACKNOLEDGEMENT:-
I AM VERY THNKFUL TO MY SUBJECT
TEACHER Miss.Deekipa WHO HELPED ME
AND GUIDES ME TO
COMPLETE THIS PROJECT ON
I AM ALSO THANKFUL TO
MY CLASSMATES
( Gaurav,Chillu,bablu.)
WHO PRPOVIDES ME VERY
IMPORTANT INFORMATION IN COMPLETING THIS
PROJECT.

-: CONTENT:-
INTRODUCTION
RATE OF CONVERGENCE
BISECTION METHOD
• EXAMPLE
ERROR ANALYSIS
• EXAMPLE
REGULA FALSI METHOD
RATE OF CONVERGENCE OF REGULA FALSI METHOD
ERROR ANALYSIS
• EXAMPLE
RESULT
REFERENCES

INTRODUCTION
A numerical method to solve equations will be a long process. We would like to k
now, if the method will lead to a solution (close to the exact solution) or will
lead us away from the solution. If the method, leads to the solution, then we s
ay that the method is convergent. Otherwise, the method is said to be divergent.
RATE OF CONVERGENCE
Various methods converge to the root at different rates. That is, some methods a
re slow to converge and it takes a long time to arrive at the root, while other
methods can lead us to the root faster. This is in general a compromise between
ease of calculation and time.
For a computer program however, it is generally better to look at methods which
converge quickly. The rate of convergence could be linear or of some higher orde
r. The higher the order, the faster the method converges
If ei is the magnitude of the error in the ith iteration, ignoring sign, then th
e order is n if is approximately constant.
It is also important to note that the chosen method will converge only if ei + 1
< ei.
BISECTION METHOD
This is one of the simplest methods and is strongly based on the property of int
ervals. To find a root using this method, the first thing to do is to find an in
terval [a,b] such that . Bisect this interval to get a point (c,f(c)). Choose o
ne of a or b so that the sign of f(c) is opposite to the ordinate at that point.
Use this as the new interval and proceed until you get the root within desired
accuracy.
Suppose f(x)f(x) is continuous on an interval [a,b][a,b], such that
Then f(x)f(x) changes sign on [a,b][a,b], and f(x)=0f(x)=0 has at least one root
on the interval. Bisection method repeatedly halve the interval [a,b][a,b], kee
ping the half on which f(x)f(x) chages sign. It guaranteed to converge to a root
.
More prececisly, Suppose that we are given an interval [a,b][a,b] satisfying Equ
ation 3 and an error tolerance >0 >0. Then the bisection method is consists of the
following steps:
[B1.] Compute c=(a+b)/2c=(a+b)/2
[B2.] If b-c≤ b-c≤ , then accept c as the root and stop the procedure.
[B3.] If f(a).f(c)≤0f(a).f(c)≤0, then set b=cb=c else, set a=ca=c. Go to step B1.
EXAMPLE
Solve x3 - 2x - 5 = 0 correct up to 2 decimal places.
f(x) = x3 - 2x - 5
f(x1) = 5.625 > 0
ERROR ANALYSIS
The maximum error after the ith iteration using this process will be given as

As the interval at each iteration is halved, we have . Thus this method converg
es linearly.
If we are interested in the number of iterations the Bisection Method needs to c
onverge to a root within a certain tolerance than we can use the formula for the
maximum error.
EXAMPLE
How many iterations do you need to get the root if you start with a = 1 and b =
2 and the tolerance is 10−4?
The error εi n ds to b small r than 10−4. Us th formula for th maximum rror:
εi = 2 − i < 10 − 4
Solv for i using log rul s
H nc 14 it rations will nsur an approximation to th root accurat to . Not
: th rror analysis only giv s a bound approximation to th rror; th actual
rror may b much small r.
REGULA FALSI METHOD
This m thod is ss ntially sam as th bis ction m thod xc pt that inst ad of b
is cting th int rval, w find wh r th chord joining th two points m ts th
X axis. Th roots ar calculat d using th quation of th chord, i. . putting y
= 0 in
.
Th rat of conv rg nc is still lin ar but fast r than that of th bis ction m
thod. Both th s m thods will fail if f has a doubl root.
RATE OF CONVERGENCE OF REGULA FALSI METHOD
If th function F(x) in th quation f(x)=0 is conv x in th int rval (x0,x1) th
at contains th roots,th n on of th point x0 and x1 is always fix d and th ot
h r point vari s with k. If th point x0 is fix d th n th function F(x) is appr
oximat d by th straht lin passing throught th point(x0, F0) and (xk, fk),k=1,2
,3,4,……
ERROR ANALYSIS
εk+1 = ε0εk
wh r C=0.5{f”( ε)/f’(ε)} and ε0= x0 –ε is ind p nd nt of k.th r for ,w can say
εk+1 = C*εk
wh r C* =Cε0 is th asymptotic rror constant.h nc th r gula
falsi m thod has
lin ar rat of conv rg c
EXAMPLE
Consid r f(x)=x2
1. W alr ady know th roots of this quation, so w can asily
ch ck how fast th r gula falsi m thod conv rg s.
For our initial gu ss, w ll us th int rval [0,2].
Sinc f is concav upwards and incr asing, a quick sk tch of th g om try shows
that th chord will always int rs ct th x
axis to th l ft of th solution. Thi
s can
 b confirm d by a littl alg bra.
W ll call our nth it ration of th int rval [an, 2]
Th chord int rs cts th x
axis wh n
R arranging and simplifying giv s
Sinc this is always l ss than th root, it is also an+1
Th diff r nc b tw n an and th root is n=an
1, but
This is always small r than n wh n an is positiv . Wh n an approach s 1, ach
xtra it ration r duc s th rror by two
thirds, rath r than on
half as th bis
ction m thod would.
In this cas , th low r nd of th int rval t nds to th root, and th minimum
rror t nds to z ro, but th upp r limit and maximum rror r main fix d. This is
not uncommon.
RESULT:

W consid r d a robust, but “slow” bis ction m thod and th n a “fast r” but l ss robust
N wton’s m thod.
REFERENCES:

www. n.wikip dia.org/wiki/N wton’s_m thods
www. funda.com/math/num.../num_rootfinding.cfm
www.caan.ric . du/
timwar/MA375F03?L ctur 29.ppt
www.wiki.answ r.com