DEPARTMENT OF MATHEMATICS

INDIAN INSTITUTE OF TECHNOLOGY DELHI

MTL 107/MAL 230 (NUMERICAL METHODS AND COMPUTATION)
PROBLEM SHEET-I

FLOATING POINT ARITMETIC

ROOT FINDING FOR NON-LINEAR EQUATIONS
1. Add the decimal numbers assuming 4 decimal digits.
(i) 9.999 101 and 1.610 101 .
(ii) 3.25 103 and 2.63 101 .

2. Add the two floating point numbers given in binary representation:

100 = 0 10000101 10010000000000000000000
0.25 = 0 01111101 00000000000000000000000.

3. True or false.
(i) Floating point addition is commutative.
(ii) Floating point addition is associative.
Given a = 1234.567, b = 45.67840 and c = 0.0004. Check if associative property holds or not (use
7-digit mantissa decimal arithmetic).

4. Consider the floating point system = 10 and t = 4. Find f l(x y), given that
x = 2.552 103 and y = 2.551 102 .
Verify that

f l(x y) (x y)
1 t+1

(x y)
2

where f l(x y) is a tdigit rounded approximation to (x y).

5. Consider a floating point arithmetic system with base = 2 and t = 3 digits in the significand. Compute (21 0.100 20 0.111) .

6. Consider the representation of floating point numbers in IEEE 754 standard. Find
(i) The largest number in magnitude representable for single precision.
(i) The largest number in magnitude representable for double precision.
(i) The smallest number in magnitude representable for single precision.
(i) The smallest number in magnitude representable for double precision.

2
7. Suppose that f l(y) is a kdigit chopped approximation to y. Show that

yf l(y)
y 10k+1 .

8. Given a system of linear equations

7 10
5 7

x
y

1
0.7

Find the exact solution for the given system. If x = 0.17 and y = 0.22 is the computed solution
of above system. Verify that the computed solution is the exact solution for the system

7 10
5 7

x
y

1.01
0.69

9. If = 10, t = 3 floating point arithmetic is used, then find f l[f l((104 + 1) 1)] and
f l[f l(104 + (1 1))]. What do you conclude about the associative property of floating point
arithmetic?
10. Let p = 0.54617 and q = 0.54601.Use four-digit arithmetic to approximate p q and
determine the absolute and relative errors using (a) Rounding (b) Chopping. (Ans. Relative error:
0.25, 0.375)
11. Use the bisection method to determine an approximation to the root that is accurate to
at least within 104 .
(a) x3 + 4x2 10 = 0
(b) 2x + 3 cos x ex = 0 (Ans. 0.976768)
(c) x2 4x + 4 ln x = 0 for 1 x 2 and 2 x 4. (Ans. 1.412392 and 3.057106)
(d) x + 1 2 sin x = 0 for 0 x 0.5 and 0.5 x 1.
12. A root of the equation f (x) = 0 lies in the interval (a, b). Determine the number of iterations necessary to solve f (x) = 0 with accuracy 103 .
(a) f (x) = x3 + x 4, a = 1, b = 4. (Ans. n = 12) (b) f (x) = x3 + 4x2 10 , a = 1, b = 2.
13. Using Newtons Iterative formula, establish the iterative formula xn+1 = 31 [2xn + xN2 ] to
n
calculate the cube root of N. Hence find the cube root of 10 accurate upto four places of decimal.
14. Find the double root of the equation x3 x2 x + 1 = 0. (Choose x0 = 0.9)
15. Find the root of the following using Newton-Raphson Method correct to four decimal places.
(a) ex sin x = 0 , x0 = 0.6
(b) x4 + x3 + 5x2 + 4x + 4 = 0 , x0 = i (Ans. 0.5 + 0.866025i)
(c) cos x 3x + 1 = 0 , x0 = /4 (Ans. 0.6071)
16. Solve x4 5x3 + 20x2 40x + 60 = 0, by Newton-Raphson Method, given that all the
roots of the given equation are all complex.
(Hint: take initial approximation x0 = 2(1 + i)) (Ans. 0.585 2.805i and 1.915 1.908i)

3
17. Find the real roots of the following system of equations by Newton-Raphson Method.
(a) x2 y 2 = 4 and x2 + y 2 = 16 , x0 = (0, 0) (Ans. (3.162, 2.450))
(b) x2 + y = 11 and y 2 + x = 7 , x0 = (0, 0) (Ans. (3.5863, 1.8476))
(c) x2 + y 20x + 40 = 0 and x + y 2 20y + 20 = 0 , x0 = (0, 0)
(d) x2 y 2 + 7 = 0 and x xy + 9 = 0 , x0 = (3.5, 4.5). (Ans. (3, 4))
18. Obtain the Newton-Raphson extended formula (Chebyshev formula of third order)
x1 = x0

f (x0 )
1 f (x0 )2 f 00 (x0 )

f 0 (x0 ) 2 f 0 (x0 )3

for the root of the equation f (x) = 0.

(xn )
19. Show that the modified Newton-Raphson Method xn+1 = xn 2f
gives a quadratic
f 0 (xn )
convergence when the equation f (x) = 0 has a pair of double roots in the neighborhood of x = xn .

20. Use Newtons Method, Secant Method and Method of false position to find the solutions
accurate to within 105 for the following problems.
(a) 3xex = 0 for 1 x 2
(Ans. Newtons Method with p0 = 1.5 gives p3 = 1.51213455.
Secant Method with p0 = 1 and p1 = 2 gives p10 = 1.51213455.
Method of False Position with p0 = 1 and p1 = 2 gives p17 = 1.51212954.)
(b) 2x + 3 cos x ex = 0 for 0 x 1
(Ans. Newtons Method with p0 = 0.5 gives p5 = 0.976773017.
Secant Method with p0 = 0 and p1 = 1 gives p5 = 10.976773017.
Method of False Position with p0 = 0 and p1 = 1 gives p5 = 0.976772976.) (c) x0.80.2 sin x =
0 for 0 x /2.
21. Consider the function f (x) = cos x x = 0. Approximate a root of f using
(a) Newtons Method, (p0 = /4) , (p3 = 0.7390851332)
(b) Secant Method, (p0 = 0.5, p1 = /4) , (p5 = 0.7390851332)
(c) Method of False Position (p0 = 0.5, p1 = /4) , (p6 = 0.7390851332)
(d) Fixed-point iteration method, (p0 = /4) . Hence, compare the approximations.
22. Use Newtons method to find a solution to the non-linear systems given below. Iterate
until k X (k) X (k1) k < 106 .
ln(x21 + x22 ) sin(x1 x2 ) = ln 2 + ln , ex1 x2 + cos(x1 x2 ) = 0. Use X (0) = (2, 2)t .
(Ans. X (6) = (1.772454, 1.772454)t )
23. Use Newtons Method with X (0) = 0 to compute X (2) for each of the following non-linear
systems.
(a)
1 x2 ) 2x2 x1 = 0,
sin(4x

41
2x1
(e e) + 4ex22 2ex1 = 0. (Ans. X (2) = (0.5131616, 0.01837622)t )
4
(b) 5x21 x22 = 0, x2 0.25(sin x1 + cos x2 ) = 0 (Ans. J(0) is singular.)

4
24. Use Bairstows method to find a complex root of the following polynomials
(a) 2x6 + 15x5 + 43x4 + 51x3 + 40x2 + 118x + 160 = 0 , p0 = 3 , q0 = 4 (Ans. 2 i)
(b) x4 5x3 + 10x2 10x + 4 = 0 , p0 = 0.5 , q0 = 0.5 (Ans. 1 i)
(c) x4 + x3 + 2x2 + x + 1 = 0 , p0 = 0.5 , q0 = 0.5.
25. Find a real root of the following using Birge-vieta method.
(a) x4 3x3 + 3x2 3x + 2 = 0 , p0 = 0.5 (Ans. p2 = 0.9999518) (b) x3 x2 x + 1 = 0 ,
p0 = 0.5 (Ans. p3 = 0.9533) (c) x4 x 10 = 0 , p0 = 1.5
(d) x4 4x2 + 5x 2 = 0 , p0 = 1.9
(e) x3 x 4 = 0 , p0 = 1.5 (Ans. p4 = 1.7963219)
26. Let (x) and 0 (x) be the continuous functions and be the fixed point of (x), then the
sequence of approximations obtained from xn+1 = (xn ) will converge to provided |0 (x)| < 1.
27. Solve the following using fixed point iteration method.
(a) x2 + 4x 2 = 0
(b) x2 2x 3 = 0.
28. Given f (x) in [a, b], Find a sequence xn that converges to the root of f (x) = 0.
(a) f (x) = x3 7x + 2 in [0, 1]
(b) f (x) = x3 x + 1 in [1, 2].
29. Consider various fixed point schemes described below in light of the fixed point theorem.
Rank them in order, based on their apparent speed of convergence.
(a) x = g1 (x) = x x3 4x2 + 10

1/2

(b) x = g2 (x) = 10
4x
x
1
(c) x = g3 (x) = 2 (10 x3 )1/2

1/2

10
.
(d) x = g4 (x) = 4+x
(Ans. The sequence in (d) converges faster than in (c).)

30. For each of the following equations, determine an interval [a, b] on which fixed point iteration will converge and perform the calculations.
x
2
(a) x = 2e 3+x
(b) x = 0.5(sin x + cos x)
(Ans.With [0, 1] and p0 = 0, we have p6 = 0.704812)
(c) x = 3x .