Scribd
Upload
99 views2 pages

Second Semester 2019-2020

This document provides 10 problems involving numerical analysis and the fixed point iteration method. The problems cover finding roots of equations using fixed point iteration, determining appropriate iterative functions, analyzing convergence properties, and identifying fixed points.

Uploaded by

Abhigyan Shekhar
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
99 views2 pages

Second Semester 2019-2020

This document provides 10 problems involving numerical analysis and the fixed point iteration method. The problems cover finding roots of equations using fixed point iteration, determining appropriate iterative functions, analyzing convergence properties, and identifying fixed points.

Uploaded by

Abhigyan Shekhar
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

Birla Institute of Technology and Science, Pilani-K K Birla Goa Campus

Second Semester 2019-2020

Numerical Analysis
(MATH F313)
Tutorial Sheet-4

Note: All the problems use 5-digit floating point arithmetic with rounding.
1. Find the root of the equation
f (x) = x5 − 3x + 8 = 0,
lying between x = −2 and x = −1, using fixed point iteration method. Perform three
iterations.
2. Find an appropriate iteration function g(x) to find the zero of
f (x) = x2 + 10 cos x = 0,
by using fixed-point iteration method. Perform three iterations.
3. Most equations f (x) = 0 can be rearranged in several ways to give x = g(x) with
which to begin the fixed-point method. For
f (x) = ex − 2x2 = 0,
one g(x) is s 
ex
x=± .
2

(a) Show that this converges to the root near 1.5 if the positive value is used and to
the root near −0.5 if the negative is used.
(b) There is a third root near 2.6. Show that we do not converge to this root even
though values near to the root are used to begin the iterations. Where does it
converge if x0 = 2.5? If x0 = 2.7?
(c) Find another rearrangement that does converge correctly to the third root.
4. Use fixed-point iteration method to determine a solution accurate to within 10−2 for
f (x) = 2 sin πx + x = 0.
Use an initial approximation p0 = 1.
5. For each of the following equations, determine suitable iterative function g(x) and an
interval [a, b] on which fixed-point iteration will converge to a positive solution of the
equation
(a) f (x) = 3x2 − ex = 0.
(b) f (x) = x − cos x = 0.
6. Use fixed point theorem to show that the sequence defined by
1 1
xn = xn−1 + , for n ≥ 1,
2 xn−1
√ √
converges to 2 whenever x0 > 2.

1
1
7. Verify that x = a
is a fixed point of the function

g(x) = x(2 − ax).

Determine the order of convergence and the asymptotic error constant to the sequence
pn+1 = g(pn ) toward x = a1 .

8. Find a and b such that the order of the convergence is quadratic while finding a root
p, using fixed point iteration with the iterative function g(x) = ax + bx2 + 1.

9. Find the parameters a, b and c in the iterative function g(x) = ax3 + bx2 + cx such that
the order of convergence for finding the root x = p using fixed point iteration method
is 3.

10. Find the fixed point(s) of the iterative function g(x) where

x3 + 3xα
g(x) = ,
3x2 + α
where α is any real constant.

You might also like