Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
4 views22 pages

Numerical 5

The document discusses numerical methods for solving equations, focusing on the Simple Iteration and Newton-Raphson methods. It outlines the process of iteration, conditions for convergence, and the advantages and drawbacks of the Newton-Raphson method, including its rapid convergence rate but challenges with multiple roots and derivative calculations. An example is provided to illustrate the application of the Newton-Raphson method for finding solutions to a specified accuracy.

Uploaded by

Radwa Essam
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
4 views22 pages

Numerical 5

The document discusses numerical methods for solving equations, focusing on the Simple Iteration and Newton-Raphson methods. It outlines the process of iteration, conditions for convergence, and the advantages and drawbacks of the Newton-Raphson method, including its rapid convergence rate but challenges with multiple roots and derivative calculations. An example is provided to illustrate the application of the Newton-Raphson method for finding solutions to a specified accuracy.

Uploaded by

Radwa Essam
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/ 22

Numerical Methods

Dr. Radwa Essam


Assistant professor
Faculty of Engineering Mansoura University
Simple
𝑓(𝑥) = 0, iteration
𝑓(𝑥) = 𝑥 - φ(𝑥) = method
0,
We now discuss another method that is of
general applicability. We begin with the
equation
Simple iteration method
Once an iteration function φ(𝑥) is chosen, one carries
out the following successive iterations

and in general

(𝒂) Certain number of iterations is achieved.

(𝒃) If where 𝑇𝑜𝑙 is certain defined accuracy


(𝒄) If
Ensuring the convergence

then among possible choices for φ(𝑥) are the


following:
Constructi
ng
Simple C
iteration
Simple iteration

For convergence of the iteration process it must be that

which is correct only if the following 𝒄𝒐𝒏𝒗𝒆𝒓𝒈𝒆𝒏𝒄𝒆 𝒄𝒐𝒏𝒅𝒊𝒕𝒊𝒐𝒏 holds


Simple iteration
Simple iteration
Simple iteration
Newton-Raphson method
• The intersection between this tangent and the 𝑥 - 𝑎𝑥𝑖𝑠 gives the first approximated solution . The value of
is computed by substituting when 𝑦 = 0 in equation (2), so we have

• The intersection between this tangent and the 𝑥 - 𝑎𝑥𝑖𝑠 gives the first approximated solution . The value of
is computed by substituting when 𝑦 = 0 in equation (2), so we have
Newton-Raphson method
Newton-Raphson method
It is clear from this equation that Newton’s method cannot be continued if for some 𝑛.
We will note that the method is most effective when 𝑓′ is bounded away from zero near the exact root α
Convergence of Newton’s method
Newton-Raphson method
Drawbacks of Newton-Raphson method
Newton-Raphson method is an extremely powerful technique, but it has three
major difficulties:
 The convergence of the method is not assured as in the case of Bisection
method. Thus, when using computer for calculations it is preferred to use the

 The method fails in the case of multiple roots since in this case 𝑓′(𝑥) = 0.
Bisection method or any other method rather than the Newton-Raphson method

 The need to know the value of the derivative of 𝑓(𝑥) at each approximation
is a major difficulty. Frequently 𝑓′(𝑥) is far more difficult and needs more
arithmetic operations to calculate than 𝑓(𝑥).
Advantage:
 Convergence rate is one of the fastest.
Newton-Raphson method
Newton-Raphson method
Newton-Raphson method

Example 4: By applying the Newton-Raphson method find correct to 5 decimal places.


Newton-Raphson method
Thank you

You might also like