PDF For Successive Approximation
PDF For Successive Approximation
PDF For Successive Approximation
Bisection Method
Summary
1.1
1.1.1 Introduction
A polynomial equation of the form
f (x) = pn (x) = a0 xn1 + a1 xn1 + a2 xn2 + + an1 x + an = 0
..(1)
x ex = cos x
..(2)
1
(m1)
() = 0
..(3)
A polynomial equation of degree n will have exactly n roots, real or complex, simple or
multiple. A transcendental equation may have one root or no root or infinite number of roots
depending on the form of
f (x).
The methods of finding the roots of f (x) = 0 are classified as,
1. Direct Methods
2. Numerical Methods.
Direct methods give the exact values of all the roots in a finite number of steps. Numerical
methods are based on the idea of successive approximations. In these methods, we start with
one or two initial approximations to the root and obtain a sequence of approximations x0, x1,
xk which in the limit as k converge to the exact root x = a.
There are no direct methods for solving higher degree algebraic equations or
transcendental equations. Such equations can be solved by Numerical methods. In these
methods, we first find an interval in which the root lies. If a and b are two numbers such that
f (a) and f (b) have opposite signs, then a root of f (x) = 0 lies in between a and b. We take a or
b or any valve in between a or b as first approximation x1. This is further improved by
numerical methods. Here we discuss few important Numerical methods to find a root of
f (x) = 0.
1.1.2
Bisection Method
This is a very simple method. Identify two points x = a and x = b such that f (a) and f (b) are
having opposite signs. Let f (a) be negative and f (b) be positive. Then there will be a root of
f (x) = 0 in between a and b.
Let the first approximation be the mid point of the interval (a, b). i.e.
x1
a b
2
If f (x1) = 0, then x1 is a root, other wise root lies between a and x1 or x1 and b according as
f (x1) is positive or negative. Then again we bisect the interval and continue the process until
the root is found to desired accuracy. Let f (x1) is positive, then root lies in between a and x1
(see fig.2.). The second approximation to the root is given by,
x2
(a x1 )
2
x3
( x2 x1 )
2
Similarly we can get other approximations. This method is also called Bolzano method.
Note: The interval width is reduced by a factor of onehalf at each step and at the end of the
ba
. The number of iterations n required
nth step, the new interval will be [an, bn] of length
2n
to achieve an accuracy is given by,
ba
log e
n
log e 2
EXAMPLE 1
Find a real root of the equation f (x) = x3 x 1 = 0, using Bisection method.
SOLUTION
First find the interval in which the root lies, by trail and error method.
f (1) =13 1 1 = 1, which is negative
f (2) = 23 2 1 = 5, which is positive
x1 =
(1 2) 3
= 1.5
2
2
x2 =
(1 1.5)
= 1.25
2
..(4)
x3 =
(1.25 1.5)
= 1.375
2
EXAMPLE 2
Find a root of f (x) = xex 1 = 0, using Bisection method, correct to three decimal places.
SOLUTION
f (0) = 0.e0 1 = 1 < 0
f (1) = 1.e1 1 = 1.7183 > 0
x1
2
f (0.5) = 0.5 e0.5 1 = 0.1756
x2 =
= 0.75
2
Proceeding like this, we get the sequence of approximations as follows.
x3 = 0.625
x4 = 0.5625
x5 = 0.59375
x6 = 0.5781
x7 = 0.5703
x8 = 0.5664
x9 = 0.5684
x10 = 0.5674
x11 = 0.5669
x12 = 0.5672,
x13 = 0.5671,
Hence, the required root correct to three decimal places is, x = 0.567.
xa
ba
..(5)
We replace the part of the curve between the points [a, f (a)] and [b, f (b)] by means of the
chord joining these points and we take the point of intersection of the chord with the x axis as
an approximation to the root (see Fig.3). The point of intersection is obtained by putting y = 0
in (5), as
a f (b) b f (a)
..(6)
x = x1 =
f (b) f (a)
x1 is the first approximation to the root of f (x) = 0.
If f (x1) and f (a) are of opposite signs, then the root lies between a and x1 and we replace b
by x1 in (6) and obtain the next approximation x2. Otherwise, we replace a by x1 and generate
the next approximation. The procedure is repeated till the root is obtained to the desired
accuracy. This method is also called linear interpolation method or chord method.
EXAMPLE 3
Find a real root of the equation f (x) = x3 2x 5 = 0 by method of False position.
SOLUTION
f (2) = 1 and f (3) = 16
Hence the root lies in between 2 and 3.
Take a = 2, b = 3.
x1 =
=
a f (b) b f (a)
f (b) f (a)
2(16) 3(1) 35
=
= 2.058823529.
17
16 (1)
EXAMPLE 4
Determine the root of the equation cos x x ex = 0 by the method of False position.
SOLUTION
f (0) = 1 and f (1) = 2. 177979523
x1
0 2.177979523 11
0.3146653378
2.177979523 1
x2 =
0.3146653378(2.177979523) 1(0.51986)
= 0.44673
2.177979523 0.51986
EXAMPLE 5
Determine the smallest positive root of x ex = 0, correct of three significant figures using
Regula False method.
SOLUTION
Here,
f (0) = 0 e0 = 1
f (1) = 1 e1 = 0.63212.
and
x1 =
0.63212 1
f (0.6127) = 0.6127 e(0.6127) = 0.0708
Hence, the next approximation lies in between 0 and 0.6127. Proceeding like this, we get
x2 = 0.57219,0
x3 = 0.5677,
x4 = 0.5672,
x5 = 0.5671,
Hence, the smallest positive root, which is correct up to three decimal places is,
x = 0.567
.. (1)
We can express f (x) = 0, in the above form in more than one way also. For example, the
equation x3 + x2 1 = 0 can be expressed in the following ways.
1
x (1 x) 2
x (1 x3 ) 2
x (1 x2 )
1
3
and so on
Let x0 be an approximation to the desired root , which we can find graphically or
otherwise. Substituting x0 in right hand side of (1), we get the first approximation as
x1 = (x0)
..(2)
The successive approximations are given by
x2 = (x1)
x3 = (x2)
.
.
.
xn = (xn 1)
..(3)
Note: The sequence of approximations x0, x1, x2 xn given by (3) converges to the root in
EXAMPLE 6
Using the method of iteration find a positive root between 0 and 1 of the equation
x ex = 1
SOLUTION
The given equation can be writhen as x = ex
(x) = ex.
1
= 0.3678794.
e
x2 =e0.3678794 = 0.6922006.
x3 = e0.6922006 = 0.5004735
x1 = e1 =
EXAMPLE 7
Find the root of the equation 2x = cos x + 31 correct to three decimal places using Iteration
method.
SOLUTION
Given equation can be written as
(cos x 3)
x
2
sin x
| ' ( x) |
1
2
Hence iteration method can be applied
Let x0 =
2
x1 =
cos 3 1.5
2
2
10
x2 =
1
cos1.5 3 1.535
2
Similarly,
x3 = 1.518,
x4 = 1.526,
x5 = 1.522,
x6 = 1.524,
x7 = 1.523,
x8 = 1.524.
EXAMPLE 8
Find a real root of 2x log10 x = 7 by the iteration method
SOLUTION
x1 =
2
1
(log10 3.79 + 7) = 3.7893
x2 =
2
1
(log10 3.7893 + 7) = 3.7893.
x3 =
2
x = 3.7893 is a root of the given equation which is correct to four significant digits.
h2
f (x0) + = 0
2!
For small valves of h, neglecting the terms with h2, h3 .. etc,. We get
..(1)
..(2)
11
f ( x0 )
f 1 ( x0 )
and
h=
x1 = x0 + h
f (x )
= x0 ' 0
f ( x0 )
Proceeding like this, successive approximation x2, x3, xn + 1 are given by,
f (x )
xn + 1 = xn ' n .
f ( xn )
..(3)
For n = 0, 1, 2,
Note:
(i)
The approximation xn+1 given by (3) converges, provided that the initial
approximation x0 is chosen sufficiently close to root of f (x) = 0.
(ii)
f ( x)
f ' ( x)
..(1)
differentiating (1) w.r.t to x and using condition for convergence of iteration method i.e.
'( x ) 1 ,
We get
1
EXAMPLE 9
Find a root of the equation x2 2x 5 = 0 by Newton Raphson method.
SOLUTION
Here f (x) = x3 2x 5.
2
f 1 (x) = 3x 2
12
Let
xn + 1 = xn
f ( xn )
f ' ( xn )
xn + 1 = x n
xn3 2 xn 5
,
3xn 2 2
n = 0, 1, 2, . . . .
x0 = 2
f (x0) = f (2) = 23 2 (2) 5 = 1
2
f 1 (x0) = f 1 (2) = 3 (2) 2 = 10
and
1
x1 = 2 = 2.1
10
f (x1) = f (2.1) = (2.1)3 2 (2.1) 5 = 0.061
2
f 1 (x1) = f 1 (2.1) = 3 (2.1) 2 = 11.23
x2 = 2.1
0.061
= 2.094568
11.23
EXAMPLE 10
Find a root of x sin x + cos x = 0, using Newton Raphson method
SOLUTION
f (x) = x sin x + cos x.
xn sin xn cos xn
,
xn cos xn
Let
x0 = = 3.1416.
x1 = 3.1416
n = 0, 1, 2, .
3.1416sin cos
= 2.8233.
3.1416cos
..(1)
13
Similarly,
x2 = 2.7986
x3 = 2.7984
x4 = 2.7984
EXAMPLE 11
Find the smallest positive root of x ex = 0, using Newton Raphson method.
SOLUTION
f (x) = x ex
Here
f 1 (x) = 1 + e
Let x0 = 1
The Newton Raphson method formula is,
xn + 1 = xn
xn e x n
, n = 0, 1, 2,
1 e x n
x1 = x0
0.63212
x0 e x0
=1
= 0.5379.
x0
1.3679
1 e
f (0.5379) = 0.0461
f ' (0.5379) = 1.584.
x2 = 0.5379 +
Similarly,
x3 = 0.56714
0.0461
= 0.567
1.584
x = 0.567 can be taken as the smallest positive root of x ex = 0., correct to three
decimal places.
Note: A method is said to be of order P or has the rate of convergence P, if P is the largest
positive real number for which there exists a finite constant c 0, such that
K 1 c K
.. (A)
14
Where K xK is the error in the kth iterate. C is called Asymptotic Error constant and
depends on derivative of f(x) at x = . It can be shown easily that the order of
convergence of Newton Raphson method is 2.
Exercise - 1.1
1.
Using Bisection method find the smallest positive root of x3 x 4 = 0 which is correct
to two decimal places.
[Ans: 1.80]
2.
3.
Find a root of the equation xe 1 = 0 which lies in (0, 1), using Bisection Method.
[Ans: 0.567]
4.
5.
Find the root of x 2x + 3x 5 = 0, which lies between 1 and 2, using Regula False
method.
[Ans: 1.8438]
6.
Compute the real root of x log x 1.2 = 0, by the Method of False position.
[Ans: 2.740]
7.
Find the root of the equation cos x x e = 0, correct to four decimal places by Method
of False position
[Ans: 0.5178]
8.
9.
10.
11.
[Ans: 1.088]
Find a real root of cot x = e , using Iteration Method.
[Ans: 0.5314]
12.
13.
15
14.
15.
Summary
Solution of algebraic and transcendental equations
1. The numerical methods to find the roots of f (x) = 0
(i)
negative or positive. Again bisection the interval and repeat same method until
the accurate root is obtained.
(ii)
Method of false position: (Regula false method): This is another method to find
the root of f (x) = 0. In this method, we choose two points a and b such that f (a),
f (b) are of apposite signs. Hence the root lies in between these points [a, f (a)],
[b, f (b)] using equation of the chord joining these points and taking the point of
intersection of the chord with the x-axis as an approximate root (using y = 0 on
a f (b ) b f ( a )
x axis) is x1 =
f (b ) f ( a )
Repeat the same process till the root is obtained to the desired accuracy.
(iii) Newton Raphson method: The successive approximate roots are given by
xn+1 = xn
f ( xn )
, n = 0, 1, 2 - - - - f ( xn )
provided that the initial approximate root x0 is choosen sufficiently close to root
of f (x) = 0
16
Find the root of the equation 2x log x = 7 which lies between 3.5 and 4 by
RegulaFalse method.
(JNTU 2006)
Solution
..(1)
x1 = 4
x1 x0
. f x0
f x1 f x
x2 = x0
x2 = 3.5
4 3.5
(0.5441)
0
.
3979
0.5441
x2 = 3.7888
Now taking x0 = 3.7888 and x1 = 4
x1 x0
x3 = x0
. f x0
f x1 f x0
x3 = 3.7888
4 3.7888
(0.0009)
0.3988
x3 = 3.7893
The required root is = 3.789
2.
Solution
Given f(x) = x ex 3 = 0
f (1) = e 3 = 0.2817 < 0
f(2) = 2e2 3 = 11.778 > 0
Now taking x0 = 1, x1 = 2
Using Regula Falsi method
x2 = x0
x2 =
x1 x0
f x0
f x1 f x0
x0 f x1 x1 f x0
f x1 f x0
(JNTU 2006)
x2 =
17
111.778 2 0.2817
11.778 0.2817
x2 = 1.329
Now f (x2) = f(1.329) = 1.329 e1.329 3 = 2.0199 > 0
f (1) = 0.2817 < 0
x3 =
x0 f x2 x2 f x0
f x2 f x0
2.0199 0.2817
2.3942
= 1.04
2.3016
x4 =
x2 f x3 x3 f x2
f x3 f x2
Solution
x0 f x1 x1 f x0
f x1 f x0
(JNTU 2006)
18
x2 =
2 0.511 3 0.7421
0.511 0.7421
x2 = 2.93557
2.93557
f (x2) = e
sin(2.93557) 1
x2 f x1 x1 f x2
f x1 f x2
x3 = 2.96199
f (x3) = e2.90199 sin(2.96199) 1 = 0.000819 < 0
x3 f x1 x1 f x3
f x1 f x3
= 2.9625898
x4 f x1 x1 f x4
f x1 f x4
x5 = 2.9626
we have
x4 = 2.9625
x5 = 2.9626
x5 = x4 = 2.962
4.
Solution
f (x) = x ex 2 = 0
f (0) = 2 < 0,
Considering x0 = 0, x1 = 1
f(0) = f(x0) = 2; f (1) = f (x1) = 0.7183
By Regula Falsi method
x2 =
x2 =
x0 f x1 x1 f x0
f x1 f x0
0 0.7183 1 2
0.7183 2
2
2.7183
x2 = 0.73575
2
x2 f x1 x1 f x2
f x1 f x2
0.73575 0.7183
0.7183 0.46445
x3 =
0.52848 0.46445
1.18275
x3 =
0.992939
1.18275
x3 = 0.83951
f (x3) = (0.83951) e0.83951 2
f (x3) = 0.056339 < 0
f (x3) =
0.83951
0.83951 e2
19
(JNTU 2007)
20
x3 f x1 x1 f x3
f x1 f x3
0.65935
= 0.851171
0.774639
x4 f x1 x1 f x4
f x1 f x4
0.617623
= 0.85245
0.724527
One root lies between x1 and x5, (i.e., x6 lies between x1 and x5)
x6 = 0.85260
Now f (x6) = 0.00006736 < 0
x7 =
x6 f x1 x1 f x6
f x1 f x6
x7 = 0.85260
6
5.
21
Using Newton-Raphson method (a) Find square root of a number (b) Find a reciprocal
of a number
[JNTU 2008]
Solution
x=
x2 = n
f (x) = x2 n = 0
..(1)
n.
f (x) = 2x
by Newton Raphson method
xi + 1 = xi
xi2 n
f ( xi )
x
i
f 1 ( xi )
2 xi
1
x
xi
2
xi
xi + 1 =
..(2)
using the above formula the square root of any number n can be found to required
accuracy
(b) To find the reciprocal of a number n
f (x) =
solution of (1) is x =
1
n=0
x
..(1)
1
n
f 1(x) =
1
x2
f (x )
Now by Newton-Raphson method, xi+1 = xi 1 i
f ( xi )
1
x N
xi + 1 = xi i
1
x2
1
xi + 1 = xi (2 xi n)
using the above formula the reciprocal of a number can be found to required accuracy.
22
6.
[JNTU 2004]
Solution
..(1)
x1 = 0.0555
x2 = 0.0555 [2 0.0555 18]
x2 = (0.0555) (1.001)
x2 = 0.0555
Hence x1 = x2 = 0.0555
The reciprocal of 18 is 0.0555
7.
[JNTU 2006]
Solution
x0 =
23
= 2.5
2
By Newton-Raphson method
f (x )
xi+1 = xi 1 i
f ( xi )
f (x )
x1 = x0 1 0
f ( x0 )
x1 = 2.5
(0.86755)
3.14808
x1 = 2.77558
(average of 2 and 3)
f ( xi )
;
f 1 ( xi )
x2 = x1
f 1( x1) = 2.80004
f ( x1) = 0.06383,
x2 = 2.77558
(0.06383)
2.80004
x2 = 2.798
f 1(x2) = 2.7983
f (x2) = 0.001080,
x3 = x2
[ 0.001080]
f ( x2 )
= 2.798
1
2.7983
f ( x2 )
x3 = 2.798.
x2 = x3
Solution
x1 = 0, x2 = 1
f (0) = f (x1) = e0 sin 0 1 = 1 < 0
f (1) = f (x2) = e1 sin (1) 1 = 1.287 > 0
f ( xi )
f 1 ( xi )
1 0
= 0.5
2
x0 = 0.5
f (x0) = e0.5 sin (0.5) 1
f 1 (x0) = e0.5 sin (0.5) + e0.5 cos (0.5) = 2.2373
x1 = x0
f ( x0 )
(0.20956)
= 0.5
2.2373
f 1 ( x0 )
23
24
x1 = 0.5936
f (x1) = e0.5936 sin (0.5936) 1 = 0.0128
f 1 (x1) = e0.5936 sin (0.5936) + e0.5936 cos (0.5936) = 2.5136
(0.0128)
f ( x1 )
= 0.5936
1
2.5136
f ( x1 )
x2 = x1
similarly
x2 = 0.58854
x3 = x2
f ( x1 )
f 1 ( x1 )
x3 = 0.58854
0.0000181
2.4983
x3 = 0.5885
x2 x3 = 0.5885
Find a real root of the equation xex cos x = 0 using Newton-Raphson method
[JNTU-2006]
Solution
Let
0 1
= 0.5
2
(average of 0 and 1)
Newton-Raphson method
xi + 1 = xi
f ( xi )
f 1 ( xi )
xi + 1 = x0
f ( x0 )
(0.053221)
= 0.5
1
f ( x0 )
(1.715966)
25
x1 = 0.5310
f (x1) = 0.040734,
x2 = x1
f 1(x1) = 3.110063
0.040734
f ( x1 )
= 0.5310
3.110064
f 1 ( x1 )
x2 = 0.5179 ;
x3 = 0.5179
f(x2) = 0.0004339,
f 1(x2) = 3.0428504
(0.0004339)
3.0428504
x3 = 0.5177
f (x3) = 0.000001106
f (x3) = 3.04214
x4 = x3
f ( x3 )
0.000001106
= 0.5177
3.04212
f ( x3 )
x4 = 0.5177
x3 = x4 = 0.5177
x
Solution
Let f(x) = x4 x 10 = 0 be the given equation. We observe that f(1) < 0, then f(2) >0.
So one root lies between 1 and 2.
Let x0 = 1, x1 = 2;
Take x2 =
x0 + x1
= 1.5;
2
Let us take x3 =
f (1.5) < 0;
1.5 2
= 1.75; we find that f (1.75) < 0,
2
So we take now x4 =
given equation.
1.75 1.875
= 1.8125 = 1.81 can be taken as the root of the
2
26
11.
[JNTU-2007]
Solution
12.
Let x2 =
x0 x1 2 3
2.5 ;
2
2
Taking x3 =
The root =
2 2.5
2.25 , we note that f (2.25) < 0;
2
2.25 2.5
2.375
2
[JNTU-2007]
Solution
1 2
1.5 ; f (1.5) = 1.25 < 0
2
Take x3 =
1.5 2
1.75
2
3
Now
Let
7
7
f (1.75) = 5 3 = ve;
4
4
1.75 2
= 1.875;
2
The root of the given equation lies between 1.75 and 1.875
The root =
1.75 1.875
= 1.813
2
13.
27
[JNTU-2006]
Solution
Here f (x) = x3 6x 4
Take x0 = 2, x1 = 3;
2.5 3
= 2.75
2
take x3 =
f (2.75) > 0
x4 =
f (2.625) < 0
2.5 2.75
= 2.625
2
2.625 2.75
= 2.69
2
1.
(2) x = log x
[Ans: (3)]
2.
(2) x3 ex = 5
(3) x2 + 11x 1 = 0
(4) None
[Ans: (2)]
3.
(2) 2.75
(3) 2.60
(4) None
[Ans: (1)]
4.
If (a) and (b) are of opposite signs and the real root of the equation (x) = 0 is
found by false position method, the first approximation x1, of the root is
(1)
(3)
a b b a
b a
ab a b
a b
(2)
(4)
a b b a
b a
a b b a
b a
[Ans: (4)]
28
5.
(2) 1, 2
(3) 2, 1
(4) (1, 0)
[Ans: (2)]
6.
th
The iteration method is said to have p order convergence if for any finite constant
K0
P
(1)
en K en 1
(3)
en 1 K e0
(2)
P
en K en 1
(4) None
[Ans: (1)]
7.
th
f '( xn )
f ( xn )
(2)
(3) xn 1 xn
f ( xn )
f '( xn )
(4) None
xn 1
xn f ( xn )
f '( xn )
[Ans: (3)]
8.
th
In the bisection method e0 is the initial error and en is the error in n iteration
(1)
1
2
(2) 1
(3)
1
2n
(4)
None
[Ans: (3)]
9.
(2) Bisection
(3) Newton-Raphson
(4) None
[Ans: (1)]
10.
A non linear equation x + x 1 = 0 is x = (x), then the choice of (x) for which the
iteration scheme xn = (xn1) x0 = 1 converge is (x)=
(1) (1 x2)1/3
(2)
1
1 x
(3)
1 x3
(d) None
[Ans: (2)]