College of Engineering Pune

Department of Mechanical Engineering

Computational Methods & Programming

Welcome!!
Session 7
 Open methods
(Newton Raphson method)
Open methods:
• Open methods differ from bracketing methods, in that open methods require
only a single starting value or two starting values that do not necessarily bracket
a root. Open methods may diverge as the computation progresses, but when
they do converge, they usually do so much faster than bracketing methods.
1. Newton-Raphson
2. Fixed point iteration or successive approximation
BRACKETING METHODS

OPEN METHODS
Newton-Raphson method:
• It is an open-method, we assume a single initial guess x1 to find the root of
equation.

• The value of x1 can be substituted in equation y = f(x) and y1 can be found.

• The value of first approximate of root is found by drawing a tangent at point

y1 whose coordinates are x1 and y1.

• So the point at which the tangent intersects the x axis is the new
approximate of root i.e. x2
Newton-Raphson method:
Y = f(x)
f(x1)
Y = f(x)
f(x3)

x5 x4 x2

x x1 x3
f(x4)

f(x2)
 Newton-Raphson method:
y1 = f(x1)
Y = f(x)

1st tangent

x x2

𝑑𝑦 x1
𝑠𝑙𝑜𝑝𝑒 𝑜𝑓 𝑙𝑖𝑛𝑒 =
𝑑𝑥
𝑑𝑦 𝑦2 −𝑦1 Y = f(x)
= = 𝑦′
𝑑𝑥 𝑥2 −𝑥1
𝐴𝑝𝑝𝑙𝑦𝑖𝑛𝑔 𝑡ℎ𝑖𝑠 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 𝑡𝑜 1𝑠𝑡 𝑡𝑎𝑛𝑔𝑒𝑡
0 − 𝑦1
𝑦 ′ = 𝑓 ′ 𝑥1 =
𝑥2 − 𝑥1
′
(𝑥2 −𝑥1 ) × 𝑓 𝑥1 = −𝑦1
−𝑦1 + 𝑥1 × 𝑓 ′ 𝑥1
𝑥2 =
𝑓 ′ 𝑥1
𝑦1 𝑦1
𝑥2 = 𝑥1 − ′ = 𝑥1 − ′
𝑓 𝑥1 𝑦1
Newton-Raphson method:
Newton-Raphson method:
Newton-Raphson method:
Newton-Raphson method:
Newton-Raphson method:
Newton-Raphson method:
Newton-Raphson method:
Newton-Raphson method:
Numerical on Newton Raphson:
Numerical on Newton Raphson:
Numerical on Newton Raphson:
Numerical on Newton Raphson:
Numerical on Newton Raphson:
Numerical on Newton Raphson: