Scribd
Upload
6 views

Lecture 4

The document discusses the Newton-Raphson method for finding roots of equations, outlining its derivation, algorithm, and step-by-step example using the equation f(x) = x² - 2. It highlights the advantages of the method, such as fast convergence and simplicity, as well as its disadvantages, including the lack of guaranteed convergence and potential issues like division by zero. Additionally, it includes homework exercises related to the topic.

Uploaded by

Sheri Gaming
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
6 views

Lecture 4

The document discusses the Newton-Raphson method for finding roots of equations, outlining its derivation, algorithm, and step-by-step example using the equation f(x) = x² - 2. It highlights the advantages of the method, such as fast convergence and simplicity, as well as its disadvantages, including the lack of guaranteed convergence and potential issues like division by zero. Additionally, it includes homework exercises related to the topic.

Uploaded by

Sheri Gaming
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/ 15

Lecture 4

Numerical Methods
[MA-200]
Newton-Raphson Method
Newton-Raphson Method
Derivation of Newton’s Method
Newton's Method
Algorithm for Newton Method
Step 1: Evaluate 𝑓 ′ 𝑥

Step 2: Choose an initial guess 𝑥0

Step 3: Estimate the new value of the root, 𝑥𝑖+1

𝑓(𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 −
𝑓 ′ 𝑥𝑖

Step 4: Specify the stopping criteria.

For example: Calculate the “Relative or Absolute Approximate Error”

𝑥𝑖+1 − 𝑥𝑖
𝑅. 𝐸 = , 𝐴. 𝐸 = 𝑥𝑖+1 − 𝑥𝑖
𝑥𝑖
Example:
Find a root of the equation f(x)= 𝒙𝟐 -2 by using Newton Raphson Method, by
initial guess 𝒙𝟎 = 𝟏.
Solution:
Let
𝑓 𝑥 = 𝑥2 − 2
𝑓′ 𝑥 = 2𝑥
𝑥0 = 1
𝑓 𝑥𝑖
𝑥𝑖+1 = 𝑥𝑖 − ′
𝑓 𝑥𝑖
1st Iteration:
At i=0
𝑓(𝑥0 )
𝑥1 = 𝑥0 − ′
𝑓 𝑥0
𝑥0 = 1
𝑓 𝑥0 = 𝑥02 − 2 = −1
𝑓 ′ (𝑥0 ) = 2𝑥0 = 2
Cont.
(−1)
𝑥1 = 1 −
2
𝑥1 = 1.5
2nd Iteration:
At, i=1
𝑓(𝑥1 )
𝑥2 = 𝑥1 − ′
𝑓 𝑥1
𝑥1 = 1.5
𝑓 𝑥1 = 𝑥12 − 2 = 0.25
𝑓 ′ (𝑥1 ) = 2𝑥1 = 3
(0.25)
𝑥2 = 1.5 −
3
𝑥2 = 1.4167
Cont.
3rd Iteration:
At, i=2
𝑥2 = 1.4167
𝑓 𝑥2 = 𝑥22 − 2 = 0.0069
𝑓 ′ (𝑥2 ) = 2𝑥2 = 2.8333
(0.0069)
𝑥3 = 1.4167 −
2.8333
𝑥3 = 1.4142
4th Iteration:
At i=3
𝑥3 = 1.4142
𝑓 𝑥3 = 𝑥32 − 2 = 0
𝑓 ′ 𝑥3 = 2𝑥3 = 2.8284
Cont.
(0)
𝑥4 = 1.4142 −
2.8284
𝑥4 = 1.4142
Absolute Error:
n=1, 𝑥1+1 − 𝑥1 = 𝑥2 − 𝑥1 = 1.4167 − 1.5 = 0.0833
n=2, 𝑥2+1 − 𝑥2 = 𝑥3 − 𝑥2 = 1.4142 − 1.4167 = 0.0025
n=3, 𝑥3+1 − 𝑥3 = 𝑥4 − 𝑥3 = 1.4142 − 1.4142 = 0
Advantages of Newton Method
• Fast convergence: It converges fast, if it converges. Which means, in
most cases we get root (answer) in less number of steps.

• It requires only one guess.

• Formulation of this method is simple. So, it is very easy to apply.

• It has simple formula, so it is easy to program.

• Derivation is more intuitive, which means it is easier to understand its


behavior, when it is likely to converge and when it is likely to diverge.
Disadvantages of Newton Method
• Its convergence is not guaranteed. So, sometimes, for given equation
and for given guess we may not get solution.

• Division by zero problem can occur.

• Root jumping might take place thereby not getting intended solution.

• Symbolic derivative is required.

• In case of multiple roots, this method converges slowly.


Summary
Homework

Exercise 2.3
Q1, Q2, Q5, Q6, Q11, Q12, Q13(c), Q15, Q16, Q18

Exercise 2.4
Q1 and Q2
END OF SECTION

You might also like