NEWTON RAPHSON
METHOD
Presented To –
Dr. Ajay Kumar
Dr. D. Shadukhan
OUTLINE
Introduction
Historical background
Concept
Derivation
Convergence
Algorithm
Code
Advantages and Limitations
Application
Conclusion
INTRODUCTION
Overview: An iterative method for finding roots of nonlinear
equations.
Mechanism: Approximates the root using tangent lines from an
initial guess.
The Newton-Raphson method is based on the idea of using the tangent line to
a function at a given point as an approximation to the function.
HISTORICAL BACKGROUND:-
Newton's Work (1669):-
The method is named after Sir Isaac Newton, who, in his work
"Mathematical Principles of Natural Philosophy," laid the groundwork for calculus. While he didn't
explicitly formulate the method, his ideas on tangents and approximations to functions were
foundational.
Raphson's Contribution (1690):-
Joseph Raphson, an English mathematician, formalized the method
in his book "Analysis Aequationum," where he described an iterative process for finding roots of
equations. Raphson's approach used derivatives and was a significant step toward the modern
form of the method.
Later Developments:-
With the advent of computers in the mid-20th century, the Newton-Raphson
method gained popularity in numerical analysis, becoming a staple in scientific computing. Its
efficiency for finding roots of nonlinear equations made it a preferred choice in engineering and
physics.
CONCEPT:-
The Newton-Raphson method is a powerful iterative
technique for approximating the roots of nonlinear
equations. It starts with an initial guess, , and refines this
estimate using the formula
Where f is the function and f′ is its derivative. This process
continues until the change between successive
approximations is minimal or until the function value is
sufficiently close to zero. The method is particularly
effective when the initial guess is near the actual root and
is widely used in various fields, including engineering and
Derivatio
n
• Let x be the initial guess, if we draw a tangent at point x0 on the
curve f(x) ,the tangent will intersect at x1 point on x axis, which
will be a better approximation of the root. Now, drawing another
tangent at [x1, f(x1)], which cuts the x-axis at x2, which is a still
better approximation and the process can be continued till the
desired accuracy is achieved.
Now the slope at x0 is :
So - x1 = x 0 –
Now x1 is the better approximation than x0.
Similarly, the successive approximations x2, x3,
…., xn+1
are given by –
xn+1 = xn –
This is newton Raphson formula, we have to
iterate this formula until xn+1 = xn or ℇ > xn+1 – xn
(where ℇ is tolerence in the approximation of the
root)
CONVERGENCE:-
Newton Raphson is the iterative scheme as-
𝒇 ( 𝒙𝒏 )
𝒙 𝒏+𝟏 = 𝒙 𝒏 −
𝒇 ( ′ 𝒙 𝒏)
By Fixed Point Iterative Method
For Convergence -
|𝑔′ ( 𝑥 )|<1
<1
<
is the required convergence condition.
ALGORITHM
1. Start
2. Define variables and functions
3. Read approximate root (x0), required tolerance(acc)
4. In Do Loop, Calculate x1=x0-f(x0)/df(x0)
5. If abs(x1-x0)<exp then print root is x1 and exit.
6. Do until abs(x1-x0)<exp and print x1
7. Stop
(I) FORTRAN CODE FOR ROOT
FINDING
to Eight Significant Figures
Summary of key steps :
• Objective: Find a root of the equation
using Newton-Raphson.
• Initial guess:
• Iterations: 7 iterations of the update formula
to improve the estimate of the root.
• Output: Prints the computed root after the
iterations.
OUTPUT & GRAPHICAL
REPRESENTATION
OUTPUT :
(II) FORTRAN CODE FOR ROOT
FINDING
in the interval [-5,5]
Summary of key steps :
• Objective: Find a root of the equation
using Newton-Raphson.
• Initial guess:
• Iterations: 4 iterations of the update formula
to improve the estimate of the root.
• Output: Prints the computed root after the
iterations.
OUTPUT & GRAPHICAL
REPRESENTATION
OUTPUT :
Advantages of the Newton-Raphson
Method
• Quadratic Convergence: Rapidly approaches the root
when close, making it efficient.
• Fewer Iterations: Generally requires fewer iterations
than linear methods.
• Broad Applicability: Works well for various continuous
functions.
• Direct Derivative Use: Incorporates both function and
its derivative for precise updates.
LIMITATIONS OF THE NEWTON-RAPHSON
METHOD
• Derivative Necessity: Requires continuous and differentiable
functions.
• Initial Guess Sensitivity: Poor initial guesses can lead to
divergence.
• Convergence Issues: May converge to non-root points or
oscillate.
• Function Complexity: Struggles with functions lacking a clear
derivative.
APPLICATIONS
1. Root Finding: Solving nonlinear equations in various fields.
2. Physics: Solving complex equations in mechanics.
3. Engineering: Solving electrical equations in circuit analysis.
4. Machine Learning: Optimizing loss functions in algorithms.
CONCLUSION
1. Efficiency: Rapid convergence enhances computational speed.
2. Simplicity: Straightforward implementation in Fortran.
3. Robustness: Effective for various nonlinear equations.
4. Limitations: Requires a good initial guess and differentiable
functions.
5. Applications: Widely used in engineering and scientific
computing.
THANK YOU ALL FOR YOUR ATTENTION!
C
ASHUTOSH
KUSHWAHA
ARTI
