Scribd
Upload
35 views2 pages

Adobe Scan 08 Apr 2024

The document describes the method of bisection for finding the root of an equation. It gives the iterative process used to successively narrow down the interval containing the root until the interval is sufficiently small. It provides an example computation scheme showing the iteration steps and tracking how the interval is bisected on each step based on the sign of the function value at the midpoint.

Uploaded by

rookhum
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views2 pages

Adobe Scan 08 Apr 2024

The document describes the method of bisection for finding the root of an equation. It gives the iterative process used to successively narrow down the interval containing the root until the interval is sufficiently small. It provides an example computation scheme showing the iteration steps and tracking how the interval is bisected on each step based on the sign of the function value at the midpoint.

Uploaded by

rookhum
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CHAPTER 6: SoLN. OF ALGEBRAIC & TRANSCENDENTAL EQNs.

225

Table: T," (4.9 <1<5.0)


4.90 4.91 4.92 4.93 4.94 4.95 4.96 4.97 4.98 4.99 5.00
f(a) :-6.48 -5.79 -2.89 -0.59 0.20

Here f(4.98) f(4.99) <0,..y between 4.98 and 4.99. Again we compute flr) for
asccessive values of rstarting with 4.98 and with step length 0.001.
Table: T(4.98 < y < 4.99)
: 4.980 4.981 4.982 4.983 4.984 4.985 4.986 4.987 4.988 4.989
f(r) : -0.59 -0.201 -0.042 0.037

As f(4.987) x f(4.988) <0,y lies within the interval (4.987, 4.988). Thus, 7 = 4.99
is a root of f(r) =0, uptotwo decimal places.
b NoTE 6.2.1 As the method is laborious and we are only interested in finding an
erpected sufficiently small interval in which f() changes siqn, we use a short-cut
approach on and from table T,". In table T,°, it is confirmed that only one root
alies in (1.76, 1.77). For table T°), we first urite f(1.760) = -0.07 < 0 from tuble
T"), then f(1.765) = -0.03 <0 and f(1.769) = 0.005 > 0 are computed, shous the
change of sign. Now we calculate f(1.768) = -0.003 which indicates that the root a
lies in the nterval (1.768,1.769). So our purpose is reached and there is no need for
computation f(r) for other arguments z < 1.768. This technique may be used in any
interval where we confirn that only one root lies within the said interval.

6.3 Method of Bisection


It is an iterative method and is based on a well known theorem which states that if
f(z) be continuous function in a closed interval a, b) and f(a)f(b) <0, then there
exists at least one real root of the equation f() = 0, between a and b. If further f()
exists and f'(e) maintains same sign in (a, b], i.e., f(z) strictly monotonic, then there
is only one real root of f(¢) = 0, in (a, b). The method of Bisection is nothing but a
repeated applications of the above theorem.
We shall determine a sufficiently small interval (ao, bol, by Graphical or Tabulation
method, in which f(ao)f (bo) <0 and f'(¢) maintains same sign in (ao. bol, so that there
is only one real root of f() = 0. Now we shall find a sequence t, each member of
which is a successive better approximation of a root say, a of f(r) = 0, in lao. bÍ as
follows. Let the interval [ao, bo] be divided in two equal parts by z1, i.e., TË = uge
and f(a1) is caleulated. If f(r1) =0, then s1 is an exact root of f(z) = 0. If f(a;) 0.
then either f(ao) f(r) <0or f(*1)f (bo) <0. If f(ao) f(z1) < 0, then the root a lies in
(a0,T1), otherwise alies in •1, bo]. For convenience we assune that a lies in [), bo) and
We re-name the interval as a1, b1lso that bË -aj = (bo - ao). Now we take '? =
and f(x) is computed, then either f(a1)f(r2) <0 or f(r2) f (b1) < 0. provided
J(2) = 0 where zg is theexact root of f()= 0. We assume here that f(a1)f(r2) < 0.
nen the root a of f(¢) = 0 lies in a1,Ty) and we call it as la2, b2. where b - 02 =
t01-a) =(bo-ao). Proceeding in this manner, we find tn+l= which is the
(+1)th approximation of the root a of f(e) =0 and lies in the interval an, bn Where
NUMERICAL ANALYSIS
226
in
<. s bo < bo for all n. If En+1 be the error
Cn F n(bo- ao) and do < b, - an <
bo-a0 ’0, as n -’ O0.
= la-n+1
approximating a by T,n+| then sn41couverges. To get a root of J(T) =0OTTrect tO p
Ius, this iterative process surely iteration so that T, and Tq+1 have the same
Sigihcant figures, we are to co uD to oth
p significant figures.

6.3.1 Computation Scheme


Find an interval •ao, bol where f(ao) f(bo) <0and f'() maintains same sign.
1.
an+1(= nja) and f(n+1) horizontally.
2. Write., n (number of iteration), an, b,,,
a,(-ve) according as f(ao) > 0
3. Insert tue or -ve sign with an, as an(+ve) or bn(-ve) or bn(+ve) according as
or f(ao) <0and -ve or +ve sign with b¡, as
f(bo) < 0 or f(bo)>0.

4. In (r+1)th iteration, write ,+l(= ) in the column of a, (+ve), if f(T,+1) >


) in
0 keeping b, fixed in the column of b,(-ve). Otherwise, write ,+1(= a,, (+ve).
the column of b, (-ve), if f(,+1) <0, keeping a, fixed in the column of

Scheme 6.1

When f(ao) >0 and f(bo) < 0

an(+ve) bn(-ve) Tn+1 (= uton


2
) f(In+1)
0 bo f(z1) > 0
1 z1(= a1) bo(= b1) f(r2) > 0
2 T2(= az) bo(= b2) ag (= atba) f(z3) < 0
3 az(= ay) ag(= bs) f(aa) <0
a2(= a4) a4(= b4) 2 f(rs) > 0
5 z;(= a;) ba(= bs) f(z¢) < 0
6 as(= ac) s(= be) f(ar) < 0
7 as(= a7) wz(= b7)
and so Ol.

You might also like