Scribd
Upload
8 views9 pages

ME 261-Lecture 7

Numeical analysis

Uploaded by

Mahfujaakter Mim
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
8 views9 pages

ME 261-Lecture 7

Numeical analysis

Uploaded by

Mahfujaakter Mim
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/ 9

ME 261: Numerical Analysis

Priom Das
Lecturer
Department of Mechanical Engineering, BUET

Lecture-7: Roots of Equations


Fixed Point Iteration & Newton’s Method

ME 261: Numerical Analysis


Fixed Point Iteration contd…

Given function, x 2 − 2 x = 3
 f ( x) = x 2 − 2 x − 3 = 0
x0 = 4
g1 ( x0 ) = 0.15 1 g 2 ( x0 ) = 0.375 1

3 alternate forms, g(x) for the


solution of function, f(x) = 0
Converge
Converge
x = g1 ( x) = 2x + 3 (A)
3
x = g 2 ( x) = ( B)
( x − 2)
x2 − 3
x = g 3 ( x) = (C)
2
g 3 ( x0 ) = 4  1
Convergence behavior depends on
the nature of the alternate form, g(x)
Diverge

Fig. Iterative progress of Fixed point Iteration method by graphical approach

ME 261: Numerical Analysis 2


ME 261: Numerical Analysis 3
Newton-Raphson Method
• One of the most widely used methods of solving non-linear equations.
• Single initial guess of root is required.
• Also known as Newton’s method.

If the initial guess is at xi, a tangent can be extended from point [xi, f(xi)]. The point where
the tangent crosses the x-axis usually represents an improved estimate of the root.

Graphical presentation of iterative


progress using Newton’s method
for finding the root of non-linear
equation, f(x)=0.

ME 261: Numerical Analysis 4


Newton-Raphson Method contd…

Using Taylor series expansion for single variable:


( xi +1 − xi ) 2
f ( xi +1 ) = f ( xi ) + ( xi +1 − xi ) f ( xi ) + f ( xi ) + ... ... ...+ H.O.T.
2!
 f ( xi +1 ) = f ( xi ) + ( xi +1 − xi ) f ( xi ) [Truncating the series after 1st derivative ]

If xi+1 is an approximation of a
root, then f(xi+1) = 0

 0 = f ( xi ) + ( xi +1 − xi ) f ( xi )

f ( xi )
 xi +1 = xi −
f ( xi )
i = 1,2,3,4, … … …

Two functions namely f(xi) and its 1st


derivative, f/(xi) are needed to
estimate the root at each iterations.

ME 261: Numerical Analysis 5


Newton-Raphson Method contd…

The expression for the estimation of root is


f ( xi )
 xi +1 = xi −
f ( xi )

In the form of

xi +1 = g ( xi ) : F.P.I.

It is known that the convergence


criteria for F.P.I. is-
g ( xi )  1
d f ( xi )
 ( xi − ) 1
dx 
f ( xi )

 f ( xi ) f ( xi )   f ( xi )2
Convergence criteria for Newton’s method

ME 261: Numerical Analysis 6


ME 261: Numerical Analysis 7
Newton-Raphson Method contd…
Problem: Consider a function, f(x) = (x-1)2(x+1). Using starting values of x0=1.20 and -1.20,
determine the real roots using Newton’s method. Compare the number of iterations required
for both cases. Take εs = 0.1%
Solution: f(x) = (x-1)2(x+1)
 f ( x) = 2( x 2 − 1) + ( x − 1) 2
Case-1: x0 = 1.20 Case-2: x0 = -1.20
Iteration xi xi +1 = xi −
f ( xi ) εa Iteration xi xi +1 = xi −
f ( xi ) εa
f ( xi ) f ( xi )
1 1.20 1.1043 - 1 -1.20 -1.0308 -

2 1.1043 1.0534 4.8% 2 -1.0308 -1.0009 3%

3 1.0534 1.0271 2.6% 3 -1.0009 -1.0000 0.09%

4 1.0271 1.0136 1.3% 4

5 1.0136 1.0068 0.7% 5

6 1.0068 1.0034 0.3%

7 1.0034 1.0017 0.2% Explain the difference in convergence rate ??

8 1.0017 1.0009 0.08%

ME 261: Numerical Analysis 8


HomeWork

ME 261: Numerical Analysis 9

You might also like