Scribd
Upload
115 views5 pages

Drawbacks of Newton's Raphson Method With Watermark

The document discusses the drawbacks of Newton's Raphson method for finding the roots of functions. Some key drawbacks are that it can converge slowly, may not converge for multiple roots or near inflection points, requires evaluating both the function and its derivative, and can result in division by zero for some initial guesses.

Uploaded by

Abdul Rehman
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
115 views5 pages

Drawbacks of Newton's Raphson Method With Watermark

The document discusses the drawbacks of Newton's Raphson method for finding the roots of functions. Some key drawbacks are that it can converge slowly, may not converge for multiple roots or near inflection points, requires evaluating both the function and its derivative, and can result in division by zero for some initial guesses.

Uploaded by

Abdul Rehman
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/ 5

Mid Term Assignment

Advanced Numerical Analysis


Bilal Hassan (098)
Semester 3rd
MPhil Mathematics
Submitted to;
Respected Mam
Dr Aqila Shaheen
(Minjah University Lahore)
Drawbacks of Newton’s Raphson Method:
The main drawbacks of Newton’s Raphson Method are
sometimes it’s slow convergence rate and infinite iterations problem.
Its drawbacks are discussed below:
1. If we have multiple roots of the equation or guess, then this
method will perform the convergence slowly. So, this method is
not suitable in case of multiple roots. Further, we must face
thousands of iterations depending upon initial guess.
Mathematically Newton’s Raphson Method is
𝑓(𝑥𝑛 )
𝑥𝑛+1 = 𝑥𝑛 − (1)
𝑓′(𝑥𝑛 )

The iterative process needs the guess of root, considering the


function, its derivative and initial value. We know that a root off
is zero of that function f in algebra. Let us suppose a simple
function 𝑓 (𝑥 ) = 𝑥 2 − 4 = 0
𝑥2 − 4 = 0
(𝑥 + 2)(𝑥 − 2) = 0
𝑥 = 2 𝑜𝑟 𝑥 = −2
In this process, we use iterative approach depends on initial
arbitrarily chosen value of x. Now we perform a test on above
stated function f(x). f’(x) will be closer to zero if we run more
iteration. To complete the process, we should be aware of below
values
𝑓 (𝑥 ) = 𝑥 2 − 4
𝑓 ′ (𝑥 ) = 2𝑥
𝑥0 = 6
Theoretically, to find a perfect representation for the root of our
function f(x), we could execute an infinite number of iterations
which is time taking process. The following table shows the
implementation of the process.
𝑛 𝑥𝑛 𝑓(𝑥𝑛 ) 𝑓′(𝑥𝑛 ) 𝑥𝑛+1 𝑑𝑥
0 6 32 12 3.33
1 3.33 7.09 6.66 2.28 1.06
2 2.27 1.15 4.54 2.01 0.26
3 2.01 0.04 4.02 2.00 0.01

Hence, using 𝑥0 = 6 we find one root of f(x) that is x=2. If we


choose different 𝑥0 then we find the same root or the other that
is x=-2.

2. This method converges slowly at inflection point. Inflection point


is a point where concavity changes from up-to-down or down-
to-up of a given function f(x). So, this method diverges if the
tangent is parallel or nearly parallel to x-axis. For example, for a
function 𝑓 (𝑥 ) = (𝑥 − 1)3 + 0.512 = 0 the below shows the
divergence near inflection point.

𝑛 𝑥𝑛
0 5
1 3.6560
2 2.7565
3 2.1084
4 1.6100
5 0.92589
6 -30.119
7 -19.746
18 0.2

3. In Newton’s Raphson Method, there is no assurance of


convergence. It does not provide solution for all equations.
If the iteration gets a point 𝑥𝑛−1 so that
𝑓 ′ (𝑛 − 1) = 0
then this method fails. At the iteration point, if f’ disappears then
this method will not be able to converge it.

4. For this method, symbolic derivation is needed. We always must


find derivative of function which is not an easy task to do.

5. In this method, there is a problem of division by zero. For


example, if we reduce the equation (1) for 𝑥0 = 0 or 𝑥0 = 0.02,
then the denominator of the equation will be equal to zero. So,
in this method, there is always a drawback of division by zero or
near a zero number.

6. Because of oscillations near local maximum and local minimum,


the convergence of Newton’s Raphson Method is slow.
Moreover, the results of Newton’s Raphson Method start
converging at local maxima or local minima instead of
converging on a root due to oscillation about local maxima or
local minima. Finally, it will take us to division by a number closer
to 0 and will diverge. For instance, if
𝑓 (𝑥 ) = 𝑥 2 + 3 = 0
Then this equation has imaginary roots.

7. This method requires the evaluation of a function f and then the


evaluation of its derivative f’ which makes the method
expensive.

8. In this method, sometimes we cannot get an intended solution


due to root jumping. If a function f(x) has more than one roots
and is oscillating then, we may select an initial guess which is
close to root. But in actual, the guesses may jump and converge
to some other roots of that function. For instance, we have a
function f(x)
𝑓(𝑥 ) = sin 𝑥 = 0
When 𝑥0 = 2.4𝜋 = 7.5398
Then f(x) will converge to x=0 instead of converging at
x=2=6.2832

9. Newton’s Raphson Method is expected to converge only when


starting value 𝑥0 is close to the actual root of the function f(x).

You might also like