Second Semester 2019-2020

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

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

Second Semester 2019-2020

Numerical Analysis
(MATH F313)
Tutorial Sheet-5

Note: All the problems use 5-digit floating point arithmetic with rounding.

1. Do three iterations of Newton’s method to obtain the double root of

f (x) = x3 − 2x2 − 0.75x + 2.25 = 0,

which is close to 1 such that iterations converges quadratically.

2. Suppose we want to solve the equation f (x) = 0, that has a root of multiplicity m at
x = p. (Assume f (x) is sufficiently differentiable function). Show that the Newton’s
iteration scheme
f (xn )
xn+1 = xn − 0 ,
f (xn )
converge only linearly. Determine the asymptotic error constant.

3. Do one iteration of Newton’s method to solve the system of nonlinear equations

x2 + y 2 = 4,
ex + y = 1.

Use an initial approximation X(0) = [1, −1]T .

4. Perform two iterations of Newton’s method for the system of nonlinear equations

4 x21 − x22 = 0,
4 x1 x22 − x1 = 1.

Use an initial approximation X(0) = [0, 1]T .

5. Do one iteration of Newton’s method to solve the system of nonlinear equations

x y 2 + x2 y + x4 = 3,
x3 y 5 − 2 x5 y − x2 = −2.

Use an initial approximation X(0) = [1, 1]T .

You might also like