Assignment 1

Subject Name: Numerical Analysis Subject Code: MA2305

Submission Deadline: 5th Sep 2018
1. Define the following the terms:
(a)Relative error
(b)Truncation error
(c)Significant digits
(d)Floating point form
(e)Rate of convergence
2. Explain the method of incremental search with a suitable example.
3. Determine the interval in which the smallest positive root of the following equations
lies:
(a) tan x  tanh x  0
(b) x 3  x  4  0
4. Find the root of f ( x)  x 3  6 x 2  11x  6 in the interval [2.5,4] using Bisection
method. Moreover, find the minimum number of iterations needed by the bisection
algorithm to approximate the root x  3 of f ( x)  x 3  6 x 2  11x  6 with error
tolerance 10 3 .
5. Find the root of f ( x)  e  x (3.2 sin x  0.5 cos x) in the interval [3,4] using Bisection
method.
3
6. Apply the method of false position to find the root of f ( x)  x 3  2 x 2  x .
2
7. Find a positive root of the following equations by Newton-Raphson method.
(a) x 3  x  1  0
(b) x  tan x (Choose initial guess 4.6)
(c) cos x  x 3  0
(d) e 2 x  x  6
8. Find the cube root of 48 by Newton-Raphson method correct up to 4-decimal places.
9. Solve the following equations using fixed point iteration method.
(a) 2 x  cos x  3
(b) sin x  10( x  1)
(c) sin 2 x  ( x 2  1)
10. Note down the main differences between Secant and Regula-Falsi method. Further,
solve the following equations using both methods.
(a) f ( x)  tan(x)  6 in the interval [0,0.48].
(b) f ( x)  x 2  2
11. Discuss (prove) the convergence of the following iterative methods for finding a root
of an equation f ( x)  0 .
(a) Fixed point iteration method
(b) Newton-Raphson method
(c) Secant method