Scribd
Upload
187 views

Numerical Methods

1. The document provides example problems involving various root finding methods including the bisection method, Newton's method, secant method, and regula-falsi method. It asks to find roots of equations, determine convergence properties of the methods, and compare the performance of different methods. 2. Section 4 discusses fixed point iteration and finding fixed points of functions. It provides examples of defining fixed point procedures and analyzing the convergence of functional iteration sequences. 3. The problems are meant to help students practice applying numerical root finding techniques and analyzing the order of convergence and properties of the iterative methods.

Uploaded by

S.Abinith Narayanan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
187 views

Numerical Methods

1. The document provides example problems involving various root finding methods including the bisection method, Newton's method, secant method, and regula-falsi method. It asks to find roots of equations, determine convergence properties of the methods, and compare the performance of different methods. 2. Section 4 discusses fixed point iteration and finding fixed points of functions. It provides examples of defining fixed point procedures and analyzing the convergence of functional iteration sequences. 3. The problems are meant to help students practice applying numerical root finding techniques and analyzing the order of convergence and properties of the iterative methods.

Uploaded by

S.Abinith Narayanan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

IIITDM Kancheepuram

MAT206T : NUMERICAL METHODS


(Root finding methods)
Problem Set 1

1 Bisection Method
a) Find a positive root of

x2 − 4x sin x + (2 sin x)2 = 0

ra
accurate to two significant figures. Use a hand calculator.

ish
b) Determine the formula
log(b0 −a0 ) −log  −log a0
n≥ log 2
−1

involving a0 − b0 , and  for the number of steps that should be taken in the bisection

a0 ≥ 0.
M
algorithm to ensure that the root is determined with relative accuracy ≤ . Assume

c) Find an interval of unit length which contains the smallest positive root of the equation
x3 − 5x − 1 = 0. Hence, determine the number of iterations required by the bisection
a
method so that |error| < 10−3 .
et
d) Let cn = 12 (an + bn ), r = limn→∞ cn and en = r − cn . Here [an , bn ], with n ≥ 0,
denote the successive intervals that arise in the bisection method when it is applied to
ik

a continuous function f .
i) Show that |en | ≤ 2−n (b1 − a1 ).
ch

ii) Show that en = O(2−n ) as n → ∞.


iii) Is it true that |e0 | ≥ |e1 | ≥ ........? Explain.
iv) Show that |cn − cn+1 | = 2−n−2 (b0 − a0 ).
Na

v) Show that for all n and m, am ≤ bn .


vi) Show that r is the unique element in the ∩∞
0 [an , bn ].
vii) Show that for all n, [an , bn ] ⊃ [an+1 , bn+1 ].
e) Give an example ( or prove that none exists ) in which

a0 < a1 < a2 < ............

f) Give an example in which

a0 = a1 < a2 = a3 < a4 = a5 < a6 = ..............


2 Newton’s Method
a) Define x0 and xn+1 = xn − [(tan xn − 1)/ sec2 xn ]. What is limn→∞ xn in this example?
Relate this to Newton’s Method.

b) Perform four iterations of Newton’s Method for the polynomial

p(x) = 4 x3 − 2 x2 + 3

starting with x0 = 1. Use a hand calculator.

c) If Newton’s Method is used on f (x) = x3 − 2 starting with x0 = 1, what is x2 ?

ra
d) Devise a Newton algorithm for computing the 5th root of any real positive number.

ish
e) Prove that Newton’s iteration will diverge for these functions, no matter what ( real )
starting point is selected.

i) f (x) = x2 + 1.

3
ii) f (x) = 7 x4 + 3 x2 + π.

Secant & regula-falsi method


M
a
a) If the secant method is applied to the function
et
f (x) = x2 − 2,
ik

with x0 = 0 and x1 = 1, what is x2 ?

b) Prove that the formula for the secant method can be written in the form
ch

f (xn ) xn−1 −f (xn−1 ) xn


xn+1 = f (xn )−f (xn−1 )
Na

Explain why this formula is inferior to


h i
n−1 −xn
xn+1 = xn − f (xn ) f (xxn−1 ) − f (xn )
.

c) Using Newton-Raphson, secant & regula-falsi method find the root of the function
f (x) = 3x − sin x − ex , correct to three decimal places. Discuss about the number of
iterations required for each and rank them as per the performance with justification.

c) Find the interval of unit length which contains the smallest negative root in magnitude
of the equation 2x3 + 3x2 + 2x + 5 = 0. Using the end point of this interval as initial
approximations, perform four iterations of the regula-falsi method.
4 Fixed points & functional iteration
a) If we attempt to find a fixed point of F by using Newton’s method on the equation
F (x) − x = 0, what iteration formula results?

b) Let 21 ≤ q ≤ 1, and define F (x) = 2 x − q x2 . On what interval can it be guaranteed


that the method of iteration using F will converge to a fixed point?

c) Write down two different fixed-point procedures for finding a zero of the function

f (x) = 2 x2 + 6 e−x − 4.

ra
d) If the method of functional iteration is used on F (x) = x2 + x + 2 and produces a
convergent sequence of positive numbers, what is the limit of that sequence and what
was the starting point?

ish
e) A student incorrectly recalls Newton’s method and writes

f 0 (xn )
xn+1 =

M f (xn )

Will this method find a zero of f ? What is the order of convergence?

e) An iteration method is defined by


a
3a x2n
 
1
xn+1 = xn 6 + − (1)
et
8 xn a
√
converges to a. Find the order of convergence of the method.
ik
ch
Na

END

You might also like