Scribd
Upload
15 views2 pages

Lecture12 Questions

The document discusses various iterative root finding methods like Newton-Raphson, modified Newton, and secant methods. It explains that Newton-Raphson method converges quadratically near the root. The modified Newton method approximates the derivative to reduce computations as the root is approached. The secant method approximates the derivative using previous iterations. It also introduces the generalized m-point iteration method.

Uploaded by

suneetha
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
15 views2 pages

Lecture12 Questions

The document discusses various iterative root finding methods like Newton-Raphson, modified Newton, and secant methods. It explains that Newton-Raphson method converges quadratically near the root. The modified Newton method approximates the derivative to reduce computations as the root is approached. The secant method approximates the derivative using previous iterations. It also introduces the generalized m-point iteration method.

Uploaded by

suneetha
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/ 2

Lesson 12

1. What is the order of convergence for the Newton Raphson method?

For functions belonging to the function space C2 i.e. for functions whose second
derivatives are continuous, the Newton-Raphson method converges quadratically near
the root .i.e p = 2. This order of convergence holds as long as round off errors in the
calculations are small enough to be ignored.

2. What is the justification for the modified Newton method?


f ( xn )
The update formula for the Newton method is: xn 1  xn  hn , hn  
f ( xn )
Thus the slope of the function f ( xn ) needs to be computed to the same relative
accuracy as the function evaluation f ( x n ) . Near the root f ( x n ) becomes smaller and
smaller. Hence its relative accuracy is low as xn approaches the root. Hence it may not
be necessary to compute f ( xn ) to unnecessary accuracy as f ( x n ) approaches the root.
Hence it may not be necessary to compute f ( xn ) at each iteration, as is done for the
modified Newton method: the rate of convergence will only be slightly slower.

3. What is the secant method?

The secant method is similar to the modified Newton method. However in this method,
instead of the actual derivative, the secant approximation to the derivative is used. The
secant method can be derived from Newton Raphson’s method by approximating the
derivative f ( xn ) as: f ( xn )  f ( xn 1 ) f n  f n 1
f ( xn )  
xn  xn 1 xn  xn 1
4. What are the conditions for the secant method to converge and what is its order of
convergence?

The secant method converges when at the root α f ( ) is not equal to zero and the
function f(x) belongs to the class of C2 functions. For the secant method p = 1.618.
Since this is less than 2.0, the Secant method has less than quadratic convergence,
unlike the Newton method.
5. What is the generalized m-point iteration method?

In the generalized m-point iteration method, the n+1 th iterate is obtained from the
function values and derivatives of f(x) at ‘m’ points, i.e.
xn 1   ( xn , xn 1 ,  xn  m )
The function φ(x) is known as the iteration function and is obtained by rewriting the
function f(x) = 0 as x = φ(x).
6. When will a generalized m-point iteration method converge?

A generalized m-point iteration method will converge under the following conditions:
Suppose that x   ( x ) has a root  , and   ( x ) exists and
satisfies the condition   ( x )  m  1 in the interval J  {x: x- α  ρ} .
Then if the starting iterate x0 belongs to J, all subsequent iterates x1, x2…. xn will also
lie in J and will converge to the root α if α is the only root of x = φ(x) in J

Suppose that x   ( x) has a root  , and  ( x) exists and


satisfies the condition  ( x)  m  1 in the interval J  {x: x-α  ρ}.
Then, for all x0  J : (a) xn  J , n  0,1,2....(b) Lim xn  
n

(c) is the only root in J of x  φ(x)

You might also like