Scribd
Upload
37 views10 pages

University Institute of Engineering Department of Computer Science and Engineering

Computer Vision

Uploaded by

Aman Vox
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
37 views10 pages

University Institute of Engineering Department of Computer Science and Engineering

Computer Vision

Uploaded by

Aman Vox
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

UNIVERSITY INSTITUTE OF

ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE
AND ENGINEERING

Numerical Methods and Optimization Using


Python DISCOVER . LEARN . EMPOWER
Course Code- 22CSH-259/22ITH-259
Dr. Hardeep Kaur (15828)
Newton-Raphson Method

• Introduction

• The Newton-Raphson method, also known simply as Newton's method, is a powerful and widely used
technique for finding successively better approximations to the roots (or zeroes) of a real-valued function. It
is an iterative method that uses the derivative of the function to find its roots. This method is particularly
useful because of its rapid convergence, especially when close to the root.

• Basic Principle

• The Newton-Raphson method is based on the idea of linear approximation. Given a function f(x) and its
derivative f′(x), we start with an initial guess for a root of f(x)=0. The function is approximated by its tangent
line at and the root of this tangent line is taken as the next approximation This process is repeated until
convergence.

2
Mathematical Formulation
• The iterative formula for the Newton-Raphson method is:

3
Pseudocode
• Here's a simple pseudocode representation of the Newton-Raphson method:

4
5
6
Advantages and Disadvantages

• Advantages:
• Rapid Convergence: The method typically converges very quickly when near the root.
• Simplicity: The formula is straightforward to implement and understand.
• Wide Applicability: Useful for a variety of functions, provided the derivative can be
computed.

• Disadvantages:
• Derivative Requirement: The method requires the function to be differentiable and the
derivative to be known.
• Initial Guess Sensitivity: Poor initial guesses can lead to divergence or slow convergence.
• Multiple Roots and Singularities: The method may fail or behave unpredictably near multiple
roots or singularities.

7
Applications

• The Newton-Raphson method is widely used in scientific computing, engineering, and


mathematics. It is particularly useful in solving nonlinear equations, optimizing functions, and
in various numerical simulations where root-finding is necessary.

8
Conclusion

• The Newton-Raphson method is a robust and efficient tool for finding the roots of functions.
Its fast convergence and simplicity make it a popular choice for numerical analysts and
engineers. However, care must be taken in choosing the initial guess and ensuring the
function and its derivative are well-behaved to guarantee the method's success.

9
THANK YOU

10

You might also like