Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Raju Sharma
Assistant Professor
Department of Civil Engineering
Chandigarh University
Introduction of polynomial
If f(x) is a quadratic or cubic equation then we can
find the root of the equation f(x) =0
(1) 2x2-8x+6=0
(2) 2x3+x2-13x+5=0
Bisection Method
This method is based on the theorem:
Y=
x2
x3
x1
interval as
e
h
t
t
c
e
is
b
Then, we
e process
h
t
e
u
in
t
n
o
before and c
desired
o
t
d
n
u
o
f
is
t
until the roo
accuracy.
(1)
f(2)=23-4 x 2 -9=-9
f(3)= 33-4 x 3 -9=6
Hence root lies b/w 2 and 3
First approximation to the root
is x1=(2+3)/2 = 2.5
Then put x1 in eq. 1
f(2.5)= 2.53-4 x 2.5-9=-3.375<
0
x7 = 2.71094
x8 = 2.70703
x9 = 2.70508
x10 = 2.70605
x11 = 2.70654
x12 = 2.70642
Hence the required root is 2.706
A[x0, f(x0)]
x3
O x
0
P(x)
x2 x1
B[x1, f(x1)]
A[x0, f(x0)]
x
3
x
0
P(x)
B[x1, f(x1)]
Secant method
This method is an improvement over the method of false
position (or Regula-falsi method ) as it does not require
the condition
f(xo) x f(x1) < 0
p((xk-1, f(xk-1))
a(xk , f(xk))
we get
xk+1
x=xk-((xk-xk-1)/f(xk)-f(xk-1)) x f(xk)
Newton-Raphson Method
Let x0 be an approximate root of the equation
f(x)=0. if x1 = x0+h be the exact root then f(x1)=0
Expanding f(x0+h) by Talors series
f(x0) +h f (x0) +(h2 /2!) f (x0) +_ _ _ _=0
Since h is very small, neglecting h2 & higher power
of h, we get
f(x0) +h f (x0) =0
h = -(f(x0)/ f (x0))
We have x1 = x0+h
x1 = x0 -(f(x0)/ f (x0))
Successive approximation are given by x2, x3, _
_ _ _, xn+1
Where
xn+1 = x0 -(f(xn)/ f (xn))
Which is known as Newton-Raphson formula
= xn f(xn)/f (xn)
= xn ((1/ xn) N)/ -(1/xn2 )
= xn + ((1/ xn) N) xn2
= xn + xn N xn2
= 2xn N xn2
xn(2-N xn)
Hence Proved
Solution:-
Iteration Method
To find the root of the equation f(x) =0
..(i)
x
=
Y
Y = (x)
o
x0
x2
x3
x1
Rate of convergence
1st Method
2nd Method
3rd method
x0
x1
5.6
3.8527
3.8327
x2
6.4
3.5693
3.56834
x3
8.3
3.55798
3.55743
x4
9.7
3.55687
3.55672
x5
10.6
3.55676
x6
11.9
3.55671
Rate of convergence
Bisection Method
1/2
Regula-falsi Method
1.62
Secent method
1.6
Newton Rapson