Numerical Analysis MTH 334: IISER Pune

Assignment 1
Date August 15, 2016

Answer all.

1. Show e−n = o( n1p ) for any real p > 0.

2. Consider the normed linear space (R2 , `1 ), where 1

 1 , x2 ) is given by |x1 | +
 ` norm of (x
1 1+ε
|x2 |. Find out the condition number of A = w.r.t. the subordinate
1−ε 1
matrix norm induced from (R2 , `1 ).

3. Prove that condition number κ(A) of an invertible matrix A is at least 1.

4. Prove that (a) κ(AB) ≤ κ(A)κ(B), (b) κ(λA) = κ(A) for λ 6= 0

5. Consider the problem of finding a positive solution of F (x) := x2 −4x sin x+4(sin x)2 =
0.
(a) Explain, why Bisection method is not directly applicable to solve the problem.
(b) Show theoretically that the positive root, if exists, should be less than 2. Show
that there is a unique positive solution in (π/3, 2).
(c) Find out two different suitable functions f such that the iteration methods xn :=
f (xn−1 ) converge to the desired solution provided the initial point is π/3.
(d) Explain why those iteration methods are ensured to converge with initial point
π/3.
(e) Execute both the iterations starting from π/3 until |xn+1 − xn | < 10−2 . Produce
tables for (i, xi , F (xi )) for i = 1, 2, . . . , n + 1.
xn+1 +xn
(f) Find out xapprox := 2
and F (xapprox ) for both the cases.
(g) Is one of the functions f , is such that the bisection method is applicable for find-
ing zero of f (x) − x? If yes, execute bisection method with 10 iterations to find an
approximate solution.
(h) Compare all three methods stated above.

W≡ × ≡V