Second Semester 2019-2020
Second Semester 2019-2020
Second Semester 2019-2020
Numerical Analysis
(MATH F313)
Tutorial Sheet-5
Note: All the problems use 5-digit floating point arithmetic with rounding.
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.
x2 + y 2 = 4,
ex + y = 1.
4. Perform two iterations of Newton’s method for the system of nonlinear equations
4 x21 − x22 = 0,
4 x1 x22 − x1 = 1.
x y 2 + x2 y + x4 = 3,
x3 y 5 − 2 x5 y − x2 = −2.