National Institute of Technology Rourkela

Department of Mathematics
Numerical Analysis

Topic: Solving nonlinear equations Assignment:I

1. Define the following terms. (i) rounding (ii) chopping (iii) floating point form
(iv)significant digits (v) loss of significant digits (vi) errors in approximation. Ex-
plain them with suitable examples.

2. Perform the first 100 iterations of the bisection method to obtain the smallest positive
root of the equation, f (x) = x3 − 5x + 1 = 0.

3. Find the number of iterations needed in bisection method to obtain an approximation

with accuracy 10−5 to the root of x3 + 4x2 − 10 = 0 lying [1,2].

4. Derive the Secant and Regula-Falsi methods. What is the difference between them.
Further, use these methods to determine the root of cos x − xex = 0 which lies in
(0, 1).

5. Derive the Newton-Raphson method (N-R method). Perform ten iterations to ap-
proximate (17)1/3 with the initial guess x0 = 2.

6. Find out the rate of convergence of Secant method and N-R method.

7. Apply N-R method to determine a root of cos x − xex = 0, with x0 = 1. Compare

your result with the first 20 iterations obtained by different methods.

8. Solve sin x = 10(x − 1) numerically by fixed point iteration method.

9. Solve numerically x cosh x = 1.

10. Find the smallest positive root of x3 − 5x + 3 = 0 by N-R method.

11. Find the root of sin2 x = x2 − 1 by iteration method.

12. Find the positive root of the equation

x2 x2 0.3x
ex = 1 + x + + e
2 6
correct to six decimal places.

13. From the equation x2 = a, deduce the Newtonian iterative procedure

 
1 a
xn+1 = xn +
2 xn
√ √
for evaluation of a. Use the above method to find 5 correct to 6-decimal places.

14. Apply N-R method to determine a root of x2 − 4x + 5 = 0. What can you conclude
about the convergence of the sequence (xn ) obtained by this method.

∗ ∗ ∗ ∗ ∗ ∗ ∗ End ∗ ∗ ∗ ∗ ∗ ∗ ∗