Scribd
Upload
9 views12 pages

Lecture 5 NRM

The Newton-Raphson Method (NRM) is an open method for finding roots of nonlinear equations that requires only one initial guess, unlike bracketing methods which need two. It uses linear approximation to iteratively converge to the root, with faster convergence when the initial guess is close to the actual root, although it may fail if the guess is too far or if the function has discontinuities. The method's advantages include rapid convergence and fewer iterations, while its disadvantages involve the necessity of computing derivatives and potential convergence issues with oscillating functions.

Uploaded by

Muneeb Tahir
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
9 views12 pages

Lecture 5 NRM

The Newton-Raphson Method (NRM) is an open method for finding roots of nonlinear equations that requires only one initial guess, unlike bracketing methods which need two. It uses linear approximation to iteratively converge to the root, with faster convergence when the initial guess is close to the actual root, although it may fail if the guess is too far or if the function has discontinuities. The method's advantages include rapid convergence and fewer iterations, while its disadvantages involve the necessity of computing derivatives and potential convergence issues with oscillating functions.

Uploaded by

Muneeb Tahir
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/ 12

NEWTON RAPHSON

METHOD(NRM)
NEWTON RAPHSON
METHOD
 Methods such as the bisection method and the false position
method of finding roots of a nonlinear equation f(x)= 0 require
bracketing of the root by two guesses. Such methods are called
bracketing methods. These methods are always convergent since
they are based on reducing the interval between the two guesses
so as to zero in on the root of the equation. In the Newton-
Raphson method, the root is not bracketed. In fact, only one
initial guess of the root is needed to get the iterative process
started to find the root of an equation. The method hence falls in
the category of open methods. Convergence in open methods is
not guaranteed but if the method does converge, it does so much
faster than the bracketing methods.
 The method is based on the idea of linear approximation. For a
function f(x), the basic idea is to use the tangent line at a point ​
to estimate the next point, , which is closer to the root.
Formula
 The Newton-Raphson iteration formula is:

where
 ​is the current guess for the root,
 is the value of the function at ​,
 is the value of the derivative of the function at ,
 s the next approximation for the root.
Algorithm of Fixed Point Iteration Method

 Start with an initial guess ​.


 Calculate and .
 Apply the Newton-Raphson formula to get​.
 Repeat the process until the difference between

successive approximations is small enough (i.e., until


convergence).
Condition for convergence of (NRM)

 Theorem
Let f:[a,b]→R be any function which is twice
differentiable in (a,b) with only one root α in (a,b).
Let and denote the first and second order derivatives
of with respect to x. If α is a simple root and is computed
by the Newton-Raphson method, then the method
converges if
<
Convergence Criteria:
 The method typically converges quickly if the initial
guess is close to the actual root and the function is
well-behaved.
 However, if the initial guess is too far from the root or

if the function has discontinuities or inflection points,


the method may not converge or may converge to the
wrong root.
Advantages and Disadvantages

Advantages:
 Very fast convergence when the initial guess is close to the root.
 Requires less iteration compared to methods like Bisection or

Regula Falsi.
Disadvantages:
 Requires the derivative f′(x), which can be difficult to compute.
 May fail to converge if the initial guess is far from the root or if
 Oscillations near local maximum and minimum
 Root jumping In some case where the function f(x) is oscillating

and has a number of roots, one may choose an initial guess close to
a root. However, the guesses may jump and converge to some other
root
Accuracy: Newton-Raphson is typically the most accurate in terms
of convergence speed and precision, especially when the initial guess
Example 1

Find a root of an equation using Newton


Raphson method
Solution:

Let
Example 1

1st iteration :

f(0.5)=(0.5)^3+2(0.5)^2+0.5-1=0.125

f′(0.5)=3(0.5)^2+4(0.5)+1=3.75

=0.5-(0.125/3.75)

=0.4667
Table

n x0 f(x0) f′(x0) x1 Update


1 0.5 0.125 3.75 0.4667 x0=x1
2 0.4667 0.0039 3.52 0.4656 x0=x1
3 0.4656 0 3.5126 0.4656 x0=x1
Questions
 Find a root of an equation using NRM
Assignment No. 1
 Solve three question of NRM, Bisection
method, RFM and Iterative method
from Burden book

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy