Biyani's Think Tank

Concept based notes

Mathematical Methods for

Numerical Analysis and Optimization
(BCA Part-II)

Varsha Gupta

Revised by: Poonam Fatehpuria

Deptt. of Information Technology

Biyani Girls College, Jaipur

Published by :

Think Tanks
Biyani Group of Colleges

Concept & Copyright :

Biyani Shikshan Samiti

Sector-3, Vidhyadhar Nagar,
Jaipur-302 023 (Rajasthan)
Ph : 0141-2338371, 2338591-95 Fax : 0141-2338007
E-mail : [email protected]
Website :www.gurukpo.com; www.biyanicolleges.org

ISBN : 978-93-81254-42-4

Edition : 2011
Price :

While every effort is taken to avoid errors or omissions in this Publication, any
mistake or omission that may have crept in is not intentional. It may be taken note of
that neither the publisher nor the author will be responsible for any damage or loss of
any kind arising to anyone in any manner on account of such errors and omissions.

Leaser Type Setted by :

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Biyani College Printing Department

For free study notes log on: www.gurukpo.com

Preface

am glad to present this book, especially designed to serve the needs of the

students. The book has been written keeping in mind the general weakness in
understanding the fundamental concepts of the topics. The book is self-explanatory
and adopts the Teach Yourself style. It is based on question-answer pattern. The
language of book is quite easy and understandable based on scientific approach.
This book covers basic concepts related to the microbial understandings about
diversity, structure, economic aspects, bacterial and viral reproduction etc.
Any further improvement in the contents of the book by making corrections,
omission and inclusion is keen to be achieved based on suggestions from the
readers for which the author shall be obliged.
I acknowledge special thanks to Mr. Rajeev Biyani, Chairman & Dr. Sanjay
Biyani, Director (Acad.) Biyani Group of Colleges, who are the backbones and main
concept provider and also have been constant source of motivation throughout this
Endeavour. They played an active role in coordinating the various stages of this
Endeavour and spearheaded the publishing work.
I look forward to receiving valuable suggestions from professors of various
educational institutions, other faculty members and students for improvement of the
quality of the book. The reader may feel free to send in their comments and
suggestions to the under mentioned address.
Author

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Syllabus
B.C.A. Part-II

Mathematical Methods for

Numerical Analysis and Optimization
Computer arithmetics and errors. Algorithms and programming for numerical
solutions. The impact of parallel computer : introduction to parallel architectures.
Basic algorithms Iterative solutions of nonlinear equations : bisection method,
Newton-Raphson method, the Secant method, the method of successive
approximation. Solutions of simultaneous algebraic equations, the Gauss
elimination method. Gauss-Seidel Method, Polynomial interpolation and other
interpolation functions, spline interpolation system of linear equations, partial
pivoting, matrix factorization methods. Numerical calculus : numerical
differentiating, interpolatory quadrature. Gaussian integration. Numerical solutions
of differential equations. Euler's method. Runge-Kutta method. Multistep method.
Boundary value problems : shooting method.

For free study notes log on: www.gurukpo.com

Content
S.No.

Name of Topic

Page No.

1.

Computer Arithmetic and Errors

2.

Bisection Method

10-15

3.

Regula Falsi Method

16-22

4.

Secant Method

23-26

5.

Newton Raphson Method

27-31

6.

Iterative Method

32-37

7.

Gauss Elimination Method

38-41

8.

Gauss Jordan Elimination Method

42-43

9.

Matrix Inversion Method

44-48

10.

Matrix Factorization Method

49-57

11.

Jacobi Method

58-61

12.

Gauss Seidel Method

62-66

13.

Forward Difference

67-67

14.

Backward Difference

68-69

15.

Newton Gregory Formula for Forward Interpolation

70-73

For free study notes log on: www.gurukpo.com

7-9

Mathematical Methods for Numerical Analysis and Optimization

S.No.

Name of Topic

7
Page No.

16.

Newtons Formula for Backward Interpolation

74-75

17.

Divided Difference Interpolation

76-79

18.

Lagranges Interpolation

80-81

19.

Spline Interpolation

82-82

20.

Quadratic Splines

83-84

21.

Cubic Splines

85-85

22.

Numerical Differentiation

85-88

23.

Numerical Integration

89-91

24.

Eulers Method

92-93

25.

Eulers Modified Method

94-97

26.

Rungs Kutta Method

98-102

27.

Shooting Method

103-104

28.

Unsolved Papers 2011 to 2006

105-170

For free study notes log on: www.gurukpo.com

Chapter-1

Computer Arithmetic and Errors

Q.1.

An approximate value of is given by x1 = 22/7 = 3.1428571 and its true

value is x = 3.1415926. Find the absolute and relative errors.

Ans.: True value of (x) = 3.1415926

Approximate value of (x1) = 3.1428571
Absolute error is given by
Ea =x x1
=3.1415926 3.1428571
= 0.0012645
Relative error is given by
Er =

x x1

3.1415926 3.1428571

3.1415926

0.0012645

3.1415926

= 0.0004025

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Q.2.

Let x = 0.00458529 find the absolute error if x is truncated to three decimal

digits.

Ans.: x = 0.00458529 = 0.458529 x 10-2 [in normalized floating point form]

x1 = 0.458 x 10-2 [after truncating to three decimal places]
Absolute error =x x1
= 0.458529 x 10-2 0.458 x 10-2
= 0.000529 x 10-2
= 0.000529 E 2
= 0.529 E 5
Q.3.

Let the solution of a problem be xa = 35.25 with relative error in the solution
atmost 2% find the range of values upto 4 decimal digits, within which the
exact value of the solution must lie.

Ans.: We are given that the approximate solution of the problem is (x a) = 35.25 and
it has relative error upto 2% so

x 35.25
< 0.02
x

= -0.02 <

x 35.25
< 0.02
x

Case-I : if -0.02x <

x 35.25
x

-0.02x < x 35.25

35.25 < x + 0.02x
35.25 < x (1 + 0.02)
35.25 < x (1.02)
35.25 < 1.02x
35.25
<x
1.02

For free study notes log on: www.gurukpo.com

10
x > 34.5588
Case-II: if

_ _ _ (1)

x 35.25
< 0.02
x

x 35.25 < 0.02x

x 0.02x < 35.25
0.98x < 35.25
x<

35.25
0.98

x < 35.9693

_ _ _ (2)

From equation (1) and (2) we have 34.5588 < x < 35.9693
The required range is (34.5588, 35.9693)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Chapter-2

Bisection Method
Q.1.

Find real root of the equation x3 - 5x + 3 upto three decimal digits.

Ans.: Here (x) = x3 5x + 3

(0) = 0 0 + 3 = 3 (x0) (say)
(1) = 1 5 + 3 = 1 = (x1) (say)
Since (x0), (x1) < 0 so the root of the given equation lies between 0 and 1
So,
Now,

x2 =

x0 + x1
0+1
=
= 0.5
2
2

(x2) = (0.5)
= (0.5)3 5 (0.5) + 3
= 0.125 2.5 + 3
= 0.625 (which is positive)

(x1).(x2) < 0

So,

x3 =

Now,

x1 + x 2
1 + 0.5
=
= 0.75
2
2

(x3) = (0.75)
= (0.75)3 5 (0.75) + 3
= 0.4218 3.75 + 3
= 0.328 (which is negative)

(x2).(x3) < 0

For free study notes log on: www.gurukpo.com

11

12
So,

x4 =

x 2 + x3
0.5 0.75
=
= 0.625
2
2

Now, (x4) = (0.625)

= (0.625)3 5 (0.625) + 3
= 0.244 3.125 + 3
= 0.119 (which is positive)

(x3).(x4) < 0

So,

x5 =

x3 + x 4
0.75 + 0.625
=
= 0.687
2
2

Now, (x5) = (0.687)

= (0.687)3 5 (0.687) + 3
= 0.1108 (which is negative)

(x4).(x5) < 0

So,

x6 =

x 4 + x5
0.625 + 0.687
=
= 0.656
2
2

Now, (x6) = (0.656)

= (0.656)3 5 (0.656) + 3
= 0.0023 (which is positive)

(x5).(x6) < 0

So,

x7 =

x5 + x 6
0.687 + 0.656
=
= 0.671
2
2

Now, (x7) = (0.671)

= (0.671)3 5 (0.671) + 3
= 0.0528 (which is negative)

(x6).(x7) < 0

So,

x8 =

x6 + x7
0.656 + 0.671
=
= 0.663
2
2

Now, (x8) = (0.663)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

13

= (0.663)3 5 (0.663) + 3
= 0.2920 3.315 + 3
= 0.023 (which is negative)

(x6).(x8) < 0

So,

x9 =

x 6 + x8
0.656 + 0.663
=
= 0.659
2
2

Now, (x9) = (0.659)

= (0.659)3 5 (0.659) + 3
= 0.0089 (which is negative)

(x6).(x9) < 0

So,

x10 =

x 6 + x9
0.656 + 0.659
=
= 0.657
2
2

Now, (x10) = (0.657)

= (0.657)3 5 (0.657) + 3
= 0.00140 (which is negative)

(x6).(x10) < 0

So,

x11 =

x 6 + x 10
0.656 + 0.657
=
= 0.656
2
2

Now, (x11) = (0.656)

= (0.656)3 5 (0.656) + 3
= 0.2823 3.28 + 3
= 0.00230 (which is positive)

(x11).(x10) < 0

So,

x12 =

x10 + x11
0.657 + 0.656
=
= 0.656
2
2

Since x11 and x12 both same value. Therefore if we continue this process we
will get same value of x so the value of x is 0.565 which is required result.

For free study notes log on: www.gurukpo.com

14
Q.2.

Find real root of the equation cos x - xex = 0 correct upto four decimal
places.

Ans.: Since, (x) = cosx - xex

So,

(0) = cos0 0e0 = 1 (which is positive)

And

(1) = cos1 1e1 = -2.1779 (which is negative)

(0).(1) < 0

Hence the root of are given equation lies between 0 and 1.

let (0) = (x0) and (1) = (x1)
So,

x2 =

x0 + x1
0+1
=
= 0.5
2
2

Now, (x2) = (0.5)

(0.5) = cos(0.5) (0.5)e 0.5
= 0.05322 (which is positive)

(x1).(x2) < 0

So,

x3 =

x1 + x 2 1 + 0.5 1.5
=
=
= 0.75
2
2
2

Now, (x3) = (0.75)

= cos(0.75) (0.75)e 0.75
= 0.856 (which is negative)

So,

(x2).(x3) < 0
x4 =

x2 + x3 0.5 + 0.75
=
= 0.625
2
2

(x4) = (0.625)
= cos(0.625) (0.625)e (0.625)
= 0.356 (which is negative)

(x2).(x4) < 0

So,

x5 =

x2 + x4 0.5 + 0.625
=
= 0.5625
2
2

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Now, (x3) = (0.5625)
= cos(0.5625) 0.5625e 0.5625
= 0.14129 (which is negative)

(x2).(x5) < 0

So,

x6 =

x2 + x5 0.5 + 0.5625
=
= 0.5312
2
2

Now, (x6) = (0.5312)

= cos(0.5312) (0.5312)e 0.5312
= 0.0415 (which is negative)

So,

(x2).(x6) < 0
x7 =

x2 + x6 0.5 + 0.5312
=
= 0.5156
2
2

Now, (x7) = (0.5156)

= cos(0.5156) (0.5156)e 0.5156
= 0.006551 (which is positive)

So,

(x6).(x7) < 0
x8 =

x6 + x7 0.513 + 0.515
=
= 0.523
2
2

Now, (x8) = (0.523)

= cos(0.523) (0.523)e 0.523
= 0.01724 (which is negative)

So,

(x7).(x8) < 0
(x9) =

x7 + x8 0.515 + 0.523
=
= 0.519
2
2

Now, (x9) = (0.519)

= cos(0.519) (0.519)e 0.519
= 0.00531 (which is negative)

For free study notes log on: www.gurukpo.com

15

16

So,

(x7).(x9) < 0
(x10) =

x7 + x9 0.515 0.519
=
= 0.5175
2
2

Now, (x10) = (0.5175)

= cos(0.5175) (0.5175)e 0.5175
= 0.0006307 (which is positive)

So,

(x9).(x10) < 0
x11 =

x9 + x10 0.5195 + 0.5175

=
= 0.5185
2
2

Now, (x11) = (0.5185)

= cos(0.5185) (0.5185)e 0.5185
= 0.002260 (which is negative)

So,

(x10).(x11) < 0
x12 =

x10 + x11 0.5175 + 0.5185

=
= 0.5180
2
2

Hence the root of the given equation upto 3 decimal places is x = 0.518
Thus the root of the given equation is x = 0.518

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

17

Chapter-3

Regula Falsi Method

Q.1.

Find the real root of the equation x log10 x 1.2 = 0 correct upto four decimal
places.

Ans.: Given (x) = x log10 x 1.2

_ _ _ (1)

In this method following formula is used xn+1 = xn

(x n - x n 1 ) f ( x n )
(f ( x n ) f ( x n 1 ))

_ _ _ (2)

Taking x = 1 in eq.(1)
(1) = 1. log101 1.2
= 2 (which is negative)
Taking x = 2 in eq.(1)
(2) = 2. log10 2 1.2
= 0.5979 (which is negative)
Taking x = 3 in eq.(1)
(3) = 3. log10 3 1.2
= 0.2313 (which is positive)

(2).(3) < 0

So the root of the given equation lies between 2 and 3.

let x1 = 2 and x2 = 3
(x1) = (2) = 0.5979

For free study notes log on: www.gurukpo.com

18
And

(x2) = (3) = 0.2313

Now we want to find x3 so using eq.(2)

x3 = x2

(x 2 - x1 ) f (x 2 )
f (x 2 ) f (x1 )

=3

(3- 2)
(0.2313)
0.2313 ( 0.5979)

=3

0.2313
0.8292

= 3 0.2789 = 2.7211
(x3) = (2.7211)
= 2.7211 log10 2.7211 1.2
= 0.01701 (which is negative)

(x2).(x3) < 0

Now to find x4 using equation (2)

x4 = x3

(x3 - x 2 ) f (x3 )
f ( x3 ) f ( x 2 )

= 2.7211

(2.7211 - 3)(-0.0170)
(-0.0170 - 0.2313)

= 2.7211

0.004743
0.2483

= 2.7211 + 0.01910 = 2.7402

Now
(x4) = (2.7402)
= 2.7402 log10 2.7402 1.2
= 0.0003890 (which is negative)

(x2).(x4) < 0

Now to find x5 using equation (2)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

x5 = x4

19

(x 4 - x 2 ) f (x 4 )
[ f (x 4 ) f (x 2 )]

= 2.7402

(2.7402 3)
( 0.0004762)
( 0.0004762 0.2313)

= 2.7402 +

( 0.2598)( 0.0004762)
0.2317

= 2.7402 +

(0.0001237)
0.2317

= 2.7402 + 0.0005341 = 2.7406

(x5) = (2.7406)
= 2.7406 log10 2.7406 1.2
= 0.0000402 (which is negative)

(x2).(x5) < 0

To find x6 using equation (2)

x6 = x5

(x5 - x 2 ) f (x5 )
f ( x5 ) f ( x 2 )

= 2.7406 +

(2.7406 - 3)
( 0.000040)
( 0.00004) (0.2313)

= 2.7406 + 0.000010 = 2.7406

The approximate root of the given equation is 2.7406 which is correct
upto four decimals.

Q.2.

Find the real root of the equation x3 2x 5 = 0 correct upto four decimal
places.

Ans.: Given equation is

(x) = x3 2x 5

_ _ _ (1)

For free study notes log on: www.gurukpo.com

20
In this method following formula is used :xn+1 = xn

(x n - x n 1 ) f (x n )
[ f (x n ) f (x n 1 )]

_ _ _ (2)

Taking x = 1 in equation (1)

(1) = 1 2 5 = 6 (which is negative)
Taking x = 2 in equation (1)
(2) = 8 4 5 = 1 (which is negative)
Taking x = 3
(3) = 27 6 5 = 16 (which is positive)
Since (2).(3) < 0
So the root of the given equation lies between 2 and 3.
Let x1 = 2 and x2 = 3
(x1) = (2) = 1
and (x2) = (3) = 16
Now to find x3 using equation (2)
x3 = x2

(x 2 - x 1 )
f (x 2 )
f (x 2 ) - f (x 1 )

=3

(3 - 2)
16
16 + 1

=3

16
17

= 2.0588

(x3) = (2.0558)3 2 (2.0588) 5

= 8.7265 4.1176 5
= 0.3911 (which is negative)
(x2).(x3) < 0

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Now to find x4 using equation (2)
x4 = x3

(x3 - x 2 )
[ f (x3 ) f ( x 2 )]

f ( x3 )

= 2.0588

(2.0588 - 3)
16
(-0.3911)

-0.3911 - 16

= 2.0588 +

( 0.9412) ( 0.3911)
= 2.0812
16.3911

(x4) = 9.0144 4.1624 5

= 0.148 (which is negative)
So

(x2) . (x4) < 0

Now using equation (2) to find x5

x5 = x4

(x 4 - x 2 )
[ f (x 4 ) f (x 2 )]

f (x 4 )

= 2.0812

(2.0812 - 3)
(-0.148)
(-0.148 - 16)

= 2.0812 +

( 0.9188) ( 0.148)
16.148

= 2.0812 + 8.4210 x

(x 5 - x 2 ) f (x 5 ) -3
10
f (x 5 ) - f (x 2 )

= 2.0896
(x5) = 9.1240 4.1792 5
= 0.0552 (which is negative)
(x2).(x5) < 0
Now using equation (2) to find x6
x6 = x5

(x5 - x 2 ) f (x5 )
f (x5 ) f ( x 2 )

= 2.0896

(2.0896 3)
(-0.0552)
( 0.0552 16)

For free study notes log on: www.gurukpo.com

21

22
= 2.0896 +

(0.05025)
16.0552

= 2.0927
(x6) = 9.1647 4.1854 5
= 0.0207 (which is negative)
So

(x2).(x6) < 0

Now using equation (2) to find x7

x7 = x6

(x 6 - x 2 )
f (x6 ) f (x 2 )

f (x6 )

= 2.0927

(2.0927 - 3)
(-0.0207)
(-0.0207 - 16)

= 2.0927 +

(-0.9073) (-0.0207)
16.0207

= 2.0927 + 1.1722 x 10-3

= 2.0938
Now (x7) = 9.1792 4.1876 5
= 0.0084 (which is negative)
So

(x2).(x7) < 0

Now using equation (2) to find x8

x8 = x7

(x 7 - x 2 )
f (x7 ) f (x 2 )

f (x7 )

= 2.0938

(2.0938 - 3)
(-0.0084)
(-0.0084 - 16)

= 2.0938 +

(-0.9062) (-0.0084)
16.0084

= 2.0938 + 4.755 x 10-4

= 2.09427

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

23

(x8) = 9.1853 4.18854 5

= 0.00324 (which is negative)
So

(x2).(x8) < 0

Now using equation (2) to find x9

x9 = x8

(x8 - x 2 )
f ( x8 ) f ( x 2 )

f ( x8 )

= 2.09427

(2.09427 - 3)
(-0.00324)
(-0.00324 - 16)

= 2.09427

(-0.90573) (-0.00324)
16.00324

= 2.0944
The real root of the given equation is 2.094 which is correct upto three
decimals.

For free study notes log on: www.gurukpo.com

24

Chapter-4

Secant Method
Note : In this method following formula is used to find root
xn+1
Q.1.

= xn

( xn xn 1 ) f ( xn )
f ( xn ) f ( xn 1 )

_ _ _ (1)

Find the root of the equation x3 5x2 17x + 20 [use Secant Method] correct
upto four decimals.

Ans.: Given (x) = x3 5x2 17x + 20

_ _ _ (2)

Taking x = 0 in equation (1)

(0) = 20
Now taking x = 1
(1) = 1 5 17 + 20
=1
Since (0) = 20 (positive) and (1) = 1 (which is negative) so the root of the
given equation lies between 0 and 1.
Let x1 = 0 and x2 = 1
(x1) = 20 and (x2) = 1
using equation (1) to find x3
x3 = x2

(x 2 - x1 )
f (x 2 ) f (x1 )

f (x 2 )

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

=1

(1 - 0)
(-1)
(-1) - 20

=1+

1
(1)
==11
(- 21)
-21
21

25

= 0.9523
(x3) = (0.9523)
= (0.9523)3 5 (0.9523)2 17 (0.9523) + 20
= 0.8636 4.5343 16.1891 + 20
= 0.1402 (which is positive)
Using equation (1) to find x4
x4 = x3

(x3 - x 2 )
f (x3 ) f ( x 2 )

f (x3 )

= 0.9523

(0.9523 - 1)
0.1402
[0.1402 - (-1)]

= 0.9523

(-0.0477) (0.1402)
(1.1402)

= 0.9523 + 0.005865

= 0.9581

(x4) = (0.9581)3 5 (0.9581)2 17 (0.9581) + 20

= 0.8794 4.5897 16.2877 + 20
= 0.0020 (which is positive)
x5 = x4

(x 4 - x3 )
f ( x 4 ) f ( x3 )

= 0.9581

f (x 4 )

(0.9581 - 0.9523)
0.0020
(0.0020) - (0.1402)

= 0.9581
Hence the root of the given equation is 0.9581 which is correct upto four
decimal.

For free study notes log on: www.gurukpo.com

26
Q.2.

Given that one of the root of the non-linear equation cos x xex = 0 lies
between 0.5 and 1.0 find the root correct upto three decimal places, by
Secant Method.

Ans.: Given equation is (x) = cos x xex

And x1 = 0.5 and x2 = 1.0
(x1) = cos (0.5) (0.5) e0.5
= 0.87758 0.82436
= 0.05321
Now (x2) = cos (1) (1) e1
= 0.54030 2.71828
= 2.1780
Now to calculate x3 using equation (1)
x3 = x2

(x 2 - x1 )
f (x 2 ) f (x1 )

f (x 2 )

=1

(1 0.5)
( 2.1780)
( 2.1780 0.05321)

=1

(0.5) (2.1780)
2.23121

= 1 0.48807
= +0.51192
(x3) = (0.51192)
= cos (0.51192) (0.51192)e0.51192
= 0.87150 0.85413
= 0.01767
Now for calculating x4 using equation (1)
x4 = x3

(x3 - x 2 )
f (x3 ) f ( x 2 )

f (x3 )

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

= 0.51192

(0.51192- 1)
0.01767
(0.1767) - (-2.1780)

= 0.51192

(-0.48808) (0.01767)
2.19567

= 0.51192 +

0.0086243
2.19567

27

= 0.51192 + 0.003927
= 0.51584
(x4) = cos (0.51584) (0.51584)e0.51584
= 0.86987 0.86405
= 0.005814 (which is positive)
Now for calculating x5 using equation (1)
x5 = x4

(x 4 - x3 )
f ( x 4 ) f ( x3 )

f (x 4 )

= 0.51584

(0.51584- 0.51192)
0.005814
(0.005814 -0.01767)

= 0.51584

0.00392
(0.005814)
(-0.01185)

= 0.51584 +0.001923
= 0.51776
= 0.5178
Now (x5) = cos (0.5178) (0.5178)e0.5178
= 0.8689 0.8690
= 0.00001
= 0.0000

(upto four decimals)

Hence the root of the given equation is x = 0.5178 (which is correct upto four
decimal places)
This process cannot be proceed further because (x5) vanishes.

For free study notes log on: www.gurukpo.com

28

Chapter-5

Newton Raphson Method

Hint : Formula uses in this method is

xn+1 = xn
Q.1.

f (x n )
f '(x n )

Find the root of the equation x2 5x + 2 = 0 correct upto 5 decimal places.

(use Newton Raphson Method.)

Ans.: : Given (x) = x2 5x + 2 = 0

Taking x = 0
(0) = 2 (which is positive)
Taking x = 1
(1) = 1 5 + 2 = 2 (which is negative)
(0) . (1) < 0
The root of the given equation lies between 0 and 1
Taking initial approximation as
x1 =

0 1
= 0.5
2

(x) = x2 5x + 2
f' (x) = 2x 5
Since x1 = 0.5
(x1) = (0.5)2 5(0.5) + 2

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

= 0.25 2.5 + 2
= 0.25
f' (x1) = 2(0.5) 5
=15
=4
Now finding x2
x2 = 0.5
= 0.5

( 0.25)
4
0.25
4

= 0.4375
(x2) = (0.4375)2 5(0.4375) + 2
= 0.19140 2.1875 + 2
= 0.003906
f' (x2) = 2(0.4375) 5
= 4.125
Now finding x3
x3 = x2

f (x 2 )
f 1 (x 2 )

= 0.4375

0.003906
( 4.125)

= 0.4375 + 0.0009469
= 0.43844
(x3) = (0.43844)2 5(0.43844) + 2
= 0.19222 2.1922 + 2
= 0.00002
f'(x3) = 2 x (0.43844) 5
= 4.12312
For free study notes log on: www.gurukpo.com

29

30
x4 = x3

f (x3 )
f 1 (x3 )

= 0.43844

0.00002
( 4.12312)

= 0.43844 + 0.00000485
= 0.43844
Hence the root of the given equation is 0.43844 which is correct upto five
decimal places.
Q.2.

Apply Newton Raphson Method to find the root of the equation 3x cos x
1 = 0 correct the result upto five decimal places.

Ans.: Given equation is

(x) = 3x cos x 1
Taking x = 0
(0) = 3(0) cos 0 1
=2
Now taking x = 1
(1) = 3(1) cos (1) 1
= 3 0.5403 1
= 1.4597
Taking initial approximation as
x1 =

0 1
= 0.5
2

(x) = 3x cos x 1
f'(x) = 3 + sin x
At x1= 0.5
(x1) = 3 (0.5) cos (0.5) 1
= 1.5 0.8775 1

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

= 0.37758
f'(x1) = 3 sin (0.5)
= 3.47942
Now to find x2 using following formula
x2 = x1
= 0.5

f (x1 )
f '(x1 )

( 0.37758)
(3.47942)

= 0.5 + 0.10851
= 0.60852
(x2) = 3 (0.60852) cos (0.60852) 1
= 1.82556 0.820494 1
= 0.005066
f'(x2) = 3 + sin (0.60852)
= 3.57165
Now finding x3
x3 = 0.60852

(0.005066)
(3.57165)

= 0.60852 0.0014183
= 0.60710
(x3) = 3 (0.60710) cos (0.60710) 1
= 1.8213 0.821305884 1
= 0.00000588
f' (x3) = 3 + sin (0.60710)
= 3 + 0.57048
= 3.5704
Now to find x4 using following formula

For free study notes log on: www.gurukpo.com

31

32
x4 = x3

f (x3 )
f '(x3 )

= 0.60710

( 0.00000588)
3.5704

= 0.60710 + 0.00000164
= 0.60710
Which is same as x3
Hence the root of the given equation is x = 0.60710 which is correct upto five
decimal places.

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

33

Chapter-6

Iterative Method
Q.1.

Find a root of the equation x3 + x2 1 = 0 in the interval (0,1) with an

accuracy of 10-4.

Ans.: Given equation is (x) = x3 + x2 1 = 0

Rewriting above equation in the form
x=

(x)

The given equation can be expressed in either of the form :

(i)

x3 + x 2 1 = 0
x3 + x 2 = 1
x2 (x + 1) = 1

(ii)

x2 =

1
1+x

x=

_ _ _ (1)

(1 x )

x3 + x 2 1 = 0
x2 = 1 x3
x = (1 + x3)

(iii)

(1/2)

_ _ _ (2)

x3 + x 2 1 = 0
x3 = 1 x2
x = (1 x2)

1/3

_ _ _ (3)

For free study notes log on: www.gurukpo.com

34
Comparing equation (1) with x g (x) = 0 we find that
1

g(x) =

(1 x )

g(x) = (1 + x) -1/2
g'(x) = (1 + x)-3/2
g'(x)= (1 + x)3/2
=

1
<1
2(1 + x )3/2

Now comparing equation (2) with x g(x) = 0

We find that g(x) = (1 x3)
g'(x)

= (1 + x3)

1/ 2

-1/2

x (- 3x2)

-3 0 1
2 2

=
g'(x)=

3
x2
2 (1 - x2 )1/2

Which is not less than one.

Now comparing equation (3) with x g(x) = 0
g(x) = (1 x2)
g'(x) =
=

1/3

1
(1 x2)-2/3 x ( 2x )
3
x
2
3 (1 - x2 )1/2

g'(x)=

2
x
3 (1 x 2 ) 2/3

Which is not less than one.

Hence this method is applicable only to equation (1) because it is convergent
for all x (0, 1)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

35

Now taking initial approximation

So

x1 =

0 1
= 0.5
2

x2 =

1
(1+ x1 )

x2 =

1
=
0.5 1

[using iteration scheme xn+1 =

1
(xn 1)

1
= 0.81649
1.5

Similarly
x3 =
x4 =
x5 =
x6 =
x7 =
x8 =

1
(x2 1)
1
(x3 1)
1
(x4 1)
1
(x5 1)
1
(x6 1)
1
(x7 1)

1
= 0.7419
0.81649 1

1
= 0.7576
0.7419 1

1
= 0.7542
0.7576 1

1
= 0.7550
0.7542 1

1
= 0.7548
0.7550 1

1
= 0.7548
0.7548 1

Hence the approximate root of the given equation is x = 0.7548

Q.2.

Find the root of the equation 2x = cos x + 3 correct upto 3 decimal places.

Ans.: Given equation is

(x) = 2x cos x 3 = 0
Rewriting above equation in the form x = g(x)
2x = cos x + 3
x=

cos x + 3
2

_ _ _ (1)

For free study notes log on: www.gurukpo.com

36
Comparing above equation with the following equation x = g(x) we find the
g(x) =
g'(x) =

cos x + 3
cos x
=
2
2

3
2

sin x
2

g'(x)=

sin x
2

For x (1, 2)
sin x< 1
Hence the iterative scheme xn+1 =

cos (xn ) + 3
is convergent.
2

Now taking initial approximation x1 = 1.5

x2 =

cos x1 + 3
cos (1.5) + 3
=
= 1.5353
2
2

x3 =

cos (x2 ) + 3
cos (1.5353) + 3
=
= 1.5177
2
2

x4 =

cos (x3 ) + 3
cos (1.5177) + 3
=
= 1.5265
2
2

x5 =

cos (x4 ) + 3
cos (1.5265) + 3
=
= 1.5221
2
2

x6 =

cos (x5 ) + 3
cos (1.5221) + 3
=
= 1.5243
2
2

x7 =

cos (x6 ) + 3
cos (1.5243) + 3
=
= 1.5230
2
2

x8 =

cos (x7 ) + 3
cos (1.5230) + 3
=
= 1.523
2
2

Which is same as x7
Hence the root of the given equation is x = 1.523 (which is correct upto 3
decimals)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Q.3.

37

Find the root of the equation xex = 1 in the internal (0, 1) (use iterative
Method)

Ans.: Given equation is xex 1 = 0

Rewriting above equation in the form of x = g (x)
xex 1 = 0
xex = 1
x = e-x
Comparing it with the equation x = g (x) we find that
g(x) = e-x
g' (x) = -e-x
g' (x) = e-x < 1
Hence the iterative scheme is
xn+1 = e

xn

Now taking initial approximation

x1= 0.5
x2 = e

x1

=e

(0.5)

x3 = e

x2

=e

(0.6065)

= 0.5452

x4 = e

x3

=e

(0.5452)

= 0.5797

x5 = e

x4

=e

0.5797

= 0.5600

x6 = e

x5

=e

0.5600

= 0.5712

x7 = e

x6

=e

(0.5712)

= 0.5648

x8 = e

x7

=e

(0.5648)

= 0.5684

x9 = e

x8

=e

(0.5684)

x10 = e

x9

=e

= 0.60653

(0.5664)

= 0.5664
= 0.5675

For free study notes log on: www.gurukpo.com

38
Now
x11 = e

x10

=e

0.5675

= 0.5669

x12 = e

x11

=e

0.5669

= 0.5672

x13 = e

x12

=e

(0.5672)

= 0.5671

x14 = e

x13

=e

(0.5671)

= 0.5671

Hence the approximate root the given equation is x = 0.5671

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

39

Chapter-7

Gauss Elimination Method

Q.1.

Use gauss elimination method to solve :

x+y+z=7
3x + 3y + 4z = 24
2x + y + 3z = 16

Ans.: Since in the first column the largest element is 3 in the second equation, so
interchanging the first equation with second equation and making 3 as first
pivot.
3x + 3y + 4z = 24

_ _ _ (1)

x+y+z

=7

_ _ _ (2)

2x + y + 3z

= 16

_ _ _ (3)

Now eliminating x form equation (2) and equation (3) using equation (1)
-3

equation (2) + 2

equation (1),

equation (3) 2

equation (1)

we get
-3x - 3y - 3z = -21
3x + 3y + 4z = 24
z 3

6x 3y 9z

and

48

6 x 6 y 8 z 48
3y z 0

= 3y - z = 0

3x + 3y + 4z = 24

_ _ _ (4)

z=3

_ _ _ (5)

3y z = 0

_ _ _ (6)

For free study notes log on: www.gurukpo.com

40
Now since the second row cannot be used as the pivot row since a 22 = 0 so
interchanging the equation (5) and (6) we get
3x + 3y + 4z = 24

_ _ _ (7)

3y z = 0

_ _ _ (8)

z=3

_ _ _ (9)

Now it is upper triangular matrix system. So by back substitution we obtain.

z=3
From equation (8)
3y 3 = 0
3y = 3
y=1
From equation (7)
3x + 3(1) + 4 (3) = 24
3x + 3 + 12 = 24
3x + 15 = 24
3x = 9
x=3
Hence the solution fo given system of linear equation is
x=3
Q.2.

y=1

z=3

Solve the following system of linear equation by Gauss Elimination

Method :
2x1 + 4x2 + x3 = 3
3x1 + 2x2 2x3 = 2
x1 x2 + x3 = 6

Ans.: Since in the first column the largest element is 3 in the second row, so
interchanging first equation with second equation and making 3 as first pivot.
3x1 + 2x2 2x3 = 2

_ _ _ (1)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

2x1 + 4x2 + x3 = 3

_ _ _ (2)

x1 x2 + x3 = 6

_ _ _ (3)

41

Eliminating x1 form equation (2) and equation (3) using equation (1)
-3

equation (2) + 2

6x1

12x2

equation (1) and + 3

3x3 =

3x1

6x1 + 4x 2
4x3 = 4
8x 2 7x 3 = 13

equation (3) equation (1)

and

8x2 + 7x3 = 13

3x 2 + 3x3 = 18

3x1 + 2x 2 2x3 = 2
5x 2 + 5x3 = 20
x2 x3 = -4

So the system now becomes :

3x1 + 2x2 2x3 = 2

_ _ _ (4)

8x2 + 7x3 = 13

_ _ _ (5)

x2 x3 = 4

_ _ _ (6)

Now eliminating x2 from equation (6) using equation (5) {8 equation (6)
equation (5)}

8x2 - 8x3 = -32

8x2 +7x3 = -13
-15x3 = -45
x3 = 3
So the system of linear equation is
3x1 + 2x2 2x3 = 2

_ _ _ (7)

8x2 + 7x3 = 13

_ _ _ (8)

x3 = 3

_ _ _ (6)

Now it is upper triangular system so by back substitution we obtain

x3 = 3
From equation (8)

For free study notes log on: www.gurukpo.com

42
8x2 + 7(3) = 13
8x2 = 13 21
8x2 = 8
x2 = 1
From equation (9)
3x1 +2(1) 2 (3) = 2
3x1 = 2 + 2 + 6
3x1 = 6
x1 = 2
Hence the solution of the given system of linear equation is :
x1 = 2

x2 = 1

x3 = 3

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

43

Chapter-8

Gauss-Jordan Elimination Method

Q.1.

Solve the following system of equations :

10x1 + 2x2 + x3 = 9

_ _ _ (1)

2x1 + 20x2 2x3 = 44

_ _ _ (2)

-2x1 + 3x2 + 10x3 = 22

_ _ _ (3)

Use Gauss Jordan Method.

Ans.: Since in the given system pivoting is not necessary. Eliminating x1 from
equation (2) and equation (3) using equation (1)
5

equation (2) equation (1)

10x1 100x2 10x3 = 220

10x1 + 2x2 + x3
= 9
98x2 11x3 = 229

equation (3) + equation (1)

10x1 + 15x2 + 50x3 = 110

and

10x1 + 2x 2 + x3
= 9
17x2 + 51x3 = 119
= x 2 + 3x 3 = 7

Now the system of equation becomes

10x1 + 2x2 + x3 = 9

_ _ _ (4)

98x2 11x3 = 229

_ _ _ (5)

x2 + 3x3= 7

_ _ _ (6)

Now eliminating x2 from equation (4) and (6) using equation (5)

For free study notes log on: www.gurukpo.com

44
98

equation (6) equation (5)

98x2 +294x3 = 686

98x2

11x3 = 229
305x3 = 915
x3 = 3

49

equation (4) - equation (5)

490x1 + 98x2 + 49x3 = 441

98x2 11x3 = 9
490x1 + 60x3 = 670
= 49x1 + 6x3 = 67

Now the system of equation becomes :

49x1 +0 + 6x3 = 67
_ _ _ (7)
98x2 11x3 = 229
_ _ _ (8)
x3 = 3
_ _ _ (9)
Hence it reduces to upper triangular system now by back substitution.
x3 = 3
From equation (8)
98x2 11 3 = 229
98x2 = 229 + 33
98x2 = 196
x2 = 2
From equation (7)
49x1 + 6(3) = 67
49x1 = 67 18
49x1 = 49
x1 = 1
Thus the solution of the given system of linear equation is
x1 = 1
,
x2 = 2
,
x3 = 3
Q.2.

Solve the following system of equation using Gauss-Jordan Elimination

Method.
2x1 2x2 + 5x3 = 13
_ _ _ (1)
2x1 + 3x2 + 4x3 = 20
_ _ _ (2)
3x1 x2 + 3x3 = 10
_ _ _ (3)
Ans.: Solve this question like question no. 17.

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

45

Chapter-9

Matrix Inversion Method

Q.1.

Solve the given system of equation using Matrix inversion Method.

6x1 + 3x2 + 7x3 = 7
x1 + 5x2 + 2x3 = -7
7x1 + 2x2 + 10x3 = 13

Ans.: The given system of equations cab be written in the form of AX = B

6 3

x1

A= 1 5 2
7 2 10

X = x2
x3

B=

7
13

The solution can be given by X = A-1B so to find the solution first we have to
find A-1 using Gauss-Jordan Method. The inverse of matrix A that is
A-1 is obtained by reducing the argumented matrix [A/I] into the matrix [I/A1]
The argumented matrix is given by

R1

6 3

1 0 0

1 5

0 1 0

7 2 10

0 0 1

R3

For free study notes log on: www.gurukpo.com

46

R2

7 2 10

0 0 1

1 5

0 1 0

6 3

1 0 0

7R2 - R1 ,

7 2
0 33
3
0
2
R1

R3

10
4
11
6

33
R1 + R2
2

231
2
2
0
33
0
R1

133 R1
+ R3
2 x 161

10241
322

R1

7
R3 - R1
6

0 0
0 7
7
0
6
,

1
2 x 33
R3 + R2
3

R3

166

4
133
3
,

1
1

0
7
77
0
3
R2

1463
4

133
3

322
R1
10241

R2

35
2
1
21

133
R2 + R3
3x4

77
3
77
3
77
3

616
69
847
12

2233
138
385
12

21

4
R2
1463

R3

3
R3
133

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

46
57
4
57
11
19

1 0 0
0 1 0
0 0 1
R1

322
R1
10241

16
57
11
57
3
19

29
57
5
57
9
19
4
R2
1463

R2

R3

3
R3
133

Hence
1
A-1 =
57

46

16

29

11

33

27

Thus the matrix A is reduced to identity matrix Hence the solution of the
given system of equations is
X =A-1 B
x1
x2
x3

1
57

46

16

29

11

33

27

13

322 + 112 - 377

1
28 - 77 - 65
57
231 - 63 + 351

Q.2.

1
57

57

114

57

Solve the following system of linear equations using matrix inversion

method.
3x1 + 2x2 + 4x3 = 7
2x1 + x2 + x3 = 7
x1 + 3x2 + 4x3 = 2

For free study notes log on: www.gurukpo.com

47

48
Ans.: The given system of linear equations can be written in the form of AX = B
3 2 4

x1

2 1 1

x2

1 3 4

x3

The solution can be given by X = A-1 B. for this we have to first find the value
of A-1 using Gauss Jordan Method.
The inverse of the matrix A using Gauss Jordan method is obtained by
reducing the argumented matrix [A/I] in the form of[I/A-1].
The argumented matrix is given as follows :
3 2 4

1 0 0

2 1 1

0 1 0

1 3 4

0 0 1

Here pivoting is not necessary.

R2

3
R2 R1
2

= 0
0

R1

4
5
2
8

1
R1 + R2
4

3
4
= 0

0
R1

2
1
2
7

0
1
2
0

9
R1 + R3
7

R3 = 3R3 R1

0 0
3
1
0
2
1 0 3

3
2
5
2
27
14

R3 =

1
R3 + R 2
14

3
4

3
0
2
3
0
2
3 3
2 14

1
15
14
,

R2

27
R2 + R3
35

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

27
28

27
70

27
14

3
28
3
10
15
14

28
R1
27

Now R1

1 0 0
= 0 1 0

0 0 1

3 3
7 14
12 3
35 14
3
3
2 14
70
R2
27

R2

1
9
7
9
5
9

4
9
8
9
7
9

49

R3

14
R3
27

2
9
5
9
1
9

Hence

1
A-1 =
9

Thus the solution of given matrix is given by

X = A-1 B
x1

i.e. x 2
x3

1
=
9

1
=
9

Hence

x1 =

28

49

56

10

35

49

31
9

1
=
9

x2 =

17
9

31
17
16

x3 =

16
9

For free study notes log on: www.gurukpo.com

50

Chapter-10

Matrix Factorization Method

Q.1.

Solve the following system of linear equation using Matrix Factorization

Method.
3x1 + 5x2 + 2x3 = 8
8x2 + 2x3 = -7
6x1 + 2x2 + 8x3 = 26

Ans.: Above system of equation can be written in the form AX = B where

3 5 2

x1

A= 0 8 2 ;
6 2 8

B=

and

7
26

Let us assume that A = LU

1

Where L = 21 1
31 32

and

U=

U11

U12

U13

U 22

U 23

U 33

U11

U12

U13

LU = 21 1
31 32

U 22

U 23

U 33

U 11

U 12

U 13

21U 11

21U 12 + U 22

21U 13 + U 23

31U 11

31U 12 + 32 U 22

31U 13 + 32 U 23 + U 33

For free study notes log on: www.gurukpo.com

X = x2
x3

Mathematical Methods for Numerical Analysis and Optimization

51

Since A = LU so comparing both matrices.

U11 = 3

_ _ _ (1)

U12 = 5

_ _ _ (2)

U13 = 2

_ _ _ (3)

21U11 = 0

_ _ _ (4)

21U12 + U22 = 8

_ _ _ (5)

21U13 + U23 = 2

_ _ _ (6)

31U11 = 6

_ _ _ (7)

31U12 + 32U22 = 2

_ _ _ (8)

31U13+ 32U22 + U33 = 8

_ _ _ (9)

21U11 = 0

21 = 0
21 = 0

_ _ _ (10)

31U11 = 6
31

3=6

31 = 6/3
31 = 2

_ _ _ (11)

Now from equation (5)

21U12 + U22 = 8
0

U12 + U22 = 8

U22 = 8

_ _ _ (12)

From equation (6)

21U13

+ U23 = 2

U13 + U23 = 2

U23 = 2
From equation (8)

31U12 + 32U22 = 2
For free study notes log on: www.gurukpo.com

_ _ _ (13)

52
2

5 + L32

8=2

32 8 = 2 10 = 8
32 = 1
From equation (9)

31U13+ 32U23 + U33 = 8

2

2 + (1)

2 + U33 = 2

U33 = 8 4 + 2
U33 = 6
1

L= 0
2

3 5 2

and

1 1

U= 0 8 2
0 0 6

Since the given system of equation can be written as AX = B

[Here A = LU]

LUX = B

_ _ _ (14)

Now let UX = Y

_ _ _ (15)

LY = B

_ _ _ (16)

y1

y2

1 1

y3

7
26

y1

y2

2y1

y2

y3

7
26

On comparing both matrices, we get

y1 = 8
and

y2 = 7

2y1 y2 + y3 = 26
2

8 + 7 + y3 = 26

y3 = 26 16 7

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

53

y3 = 3
8

Y=

7
3

From equation (15)

UX =Y
3 5 2

x1

0 8 2

x2

0 0 6

x3

7
3

3x1

5x 2

2x 3

8x 2

2x3

6x 3

7
3

Comparing both matrices

3x1 + 5x2 + 2x3 = 8

_ _ _ (17)

8x2 + 2x3 = -7

_ _ _ (18)

6 x3 = 3

_ _ _ (19)

From equation (19)

6x3 = 3
x3 =

1
2

From equation (18)

8x2 + 2x3 = 7
8x2 + 2

1
= 7
2

8x2 = 7 1
8x2 = 8
x2 = 1

For free study notes log on: www.gurukpo.com

54
From equation (17)
3x1 + 5x2 + 2x3 = 8
3x1 = 8 + 5 1
3x1 = 12
x1 = 4
Thus the solution of given system of equation is
x1 = 4

x2 = 1

and

x3 =

1
2

Q. 2. Solve the following system of linear equation using Matrix Factorization

Method.
x + 2y + 3z = 14
3x + y + 2z = 11
2x + 3y + z = 11
Ans.: Above system of equation can be written in the form of AX = B where
1 2 3

14

A= 3 1 2
2 3 1

B = 11
11

and

X= y
z

Let us assume that A = LU where

1

L = 21 1
31 32

U 11

LU = 21U 11
31U 11

and

U=

U11

U12

U13

U 22

U 23

U 33

U 12

U 13

21U 12 + U 22

21U 13 + U 23

31U 12 + 32 U 22

31U 13 + 32 U 23 + U 33

Since A = LU so comparing both sides we get

U11 = 1

_ _ _ (1)

U12 = 2

_ _ _ (2)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

55

U13 = 3

_ _ _ (3)

21U11 = 3

_ _ _ (4)

21U12 + U22 = 1

_ _ _ (5)

21U13 + U23 = 2

_ _ _ (6)

31U11 = 2

_ _ _ (7)

31U12 + 32U22 = 3

_ _ _ (8)

31U13+ 32U23 + U33 = 1

_ _ _ (9)

From equation (3)

21U11 = 3
21 1 = 3

21 = 3

_ _ _ (10)

From equation (5)

21U12 + U22 = 1
3 2 + U22 = 1
U22 = 1 6
U22 = 5

_ _ _ (11)

From equation (6)

21U13 + U23 = 2
3 3 + U23 = 2
U23 = 2 9
U23 = 7

_ _ _ (12)

From equation (7)

31U11 = 2
31 1 = 2
31 = 2
From equation (8)

31U12 + 32U22 = 3

For free study notes log on: www.gurukpo.com

_ _ _ (13)

56
2 2 + 32 (- 5) = 3

32 ( 5) = 3 4
32 =

1
5

_ _ _ (14)

From equation (9)

31U13 + 32U23 + U33 = 1

1
5

2 3+
6-

(- 7) +U33 = 1

7
+ U33 = 1
5

U33 = 1 6 +
U33 =

25 7
5

18
5

1
L=

7
7
=5+
=
5
5

_ _ _ (15)

0 0

3 1
2

and

U=

1
1
5

18
5

We know that AX = B
LUX = B

where [A = LU]

_ _ _ (16)

Now let UX = Y

_ _ _ (17)

So

_ _ _ (18)

LY = B

y1

14

y2

1
1
5

y3

= 11
11

0 0

3 1
2

y1

14

3y 1 + y 2
2y1

1
+ y2
5

y3

= 11
11

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

57

Comparing both sides we get

y1 = 14

_ _ _ (19)

3y1 + y2 = 11

_ _ _ (20)

1
2y1 + y2 + y3 = 11
5

_ _ _ (21)

From equation (20)

3y1 + y2 = 11
3

14 + y2 = 11

y2 = 11 42
y2 = 31
From equation (21)
1
2(14) + (-31) + y3 = 11
5

28

31
+ y3 = 11
5

y3 = 11 28 +
y3 = 17 +

31
5

31
5

y3 =

85 31
5

y3 =

54
5

14
Y=

31
54
5

For free study notes log on: www.gurukpo.com

58
Since UX = Y

1
0

2
5

3
7
18
5

x
0

2y
5y

14

y =
z

31
54
5

3z
7z =
18
z
5

14
31
54
5

x + 2y + 3z = 14
5y 7z = 31
18
54
z=
5
5
5
54
z=
18
5
z=3
From equation (23)
5y + 7z = 31
5y + 7

_ _ _ (22)
_ _ _ (23)
_ _ _ (24)

3 = 31

5y = 31 21 = 10
y=2
From equation (22)
x + 2y + 3z = 14
x + 4 + 9 = 14
x = 14 13
x=1
Thus the solution of the given system of equation is
x=1
;
y=2
and

z=3

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

59

Chapter-11

Jacobi Method
Q.1.

Solve the following system of equation by Jacobi Method.

83x1 + 11x2 4x3 = 95
7x1 + 52x2 + 13x3 =104
3x1 + 8x2 + 29x3 = 71

Ans.: Since the given system of equation is

83x1 + 11x2 4x3 = 95

_ _ _ (1)

7x1 + 52x2 + 13x3 =104

_ _ _ (2)

3x1 + 8x2 + 29x3 = 71

_ _ _ (3)

The diagonal elements in the given system of linear equations is not zero so
the equation (1), (2) and (3) can be written as :
x1(n+1) =

1
(n)
[95 11 x (n)
2 + 4 x3 ]
83

x (n+1)
=
2

1
[104 7 x1(n) 13 x3(n) ] and
52

x3(n+1) =

1
(n)
(n)
[71 3 x1 8 x 2 ]
29

Now taking initial approximation as :

x1(0) = 0

x(0)
2 = 0

and

x3(0) = 0

For free study notes log on: www.gurukpo.com

60
Now for first approximation :
x1(1) =

1
(0)
[95 11 x (0)
2 + 4 x 3 ] = 1.1446
83

x(1)
2 =

1
[104 7 x1(0) 13 x3(0) ] = 2
52

x3(1) =

1
[71 3 x1(0) 8 x (0)
2 ] = 2.4483
29

Similarly second approximation :

x1(2) =

=
x(2)
2 =

1
(1)
[95 11 x (1)
2 + 4 x3 ]
83
1
[95 11(2) + 4(2.4483)] = 0.9975
83
1
[104 7 x1(1) 13 x3(1) ]
52
1
[104 7(1.1446) 13(2.4483)] = 1.2338
52

x3(2) =

1
[71 3 x1(1) 8 x (1)
2 ]
29

1
[71 3(1.1446) 8
29

2] = 1.7781

Now the third iteration :

x1(3) =

=
x(3)
2 =

1
(2)
[95 11 x (2)
2 + 4 x3 ]
83

1
[95 11 (1.2338) + 4(1.7781)] = 1.0668
83
1
[104 7 x1(2) 13 x3(2) ]
52
1
[104 7
52

(0.9975) 13

(1.7781)] =

1
[73.9022]
52

= 1.4212

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

x3(3) =

1
[71 3 x1(2) 8 x (2)
2 ]
29
1
[71 3
29

(0.9975) 8

(1.2338)] = 2.0047

Similarly other iterations are :

x1(4) = 1.0528

x(4)
2 = 1.3552
x3(4) = 1.9459
x1(5) = 1.0588

x(5)
2 = 1.3718
x3(5) = 1.9655
x1(6) = 1.0575

x(6)
2 = 1.3661
x3(6) = 1.9603
x1(7) = 1.0580

x(7)
2 = 1.3676
x3(7) = 1.9620
x1(8) = 1.0579

x(8)
2 = 1.3671
x3(8) = 1.9616
x1(9) = 1.0579

x(9)
2 = 1.3671
x3(9) = 1.9616

For free study notes log on: www.gurukpo.com

61

62
Thus the values obtained by successive iteration is given by following table :
x

x1(n)

x(n)
2

x3(n)

x1(n+1)

x (n+1)
2

x3(n+1)

1.1446

2.4483

1.1446

2.4483

0.9975

1.2338

1.7781

0.9975

1.2338

1.7781

1.0667

1.4211

2.0047

1.0667

1.4211

2.0047

1.0528

1.3552

1.9459

1.0528

1.3552

1.9459

1.0587

1.3718

1.9655

1.0587

1.3718

1.9655

1.0575

1.3661

1.9603

1.0575

1.3661

1.9603

1.0580

1.3676

1.9620

1.0580

1.3676

1.9620

1.0579

1.3671

1.9616

1.0579

1.3671

1.9616

1.0579

1.3671

1.9616

Thus the solution is

x1 = 1.0579

x2 = 1.3671

and

x3 = 1.9616

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

63

Chapter-12

Gauss Seidel Method

[This method is also called the method of successive displacement]

Q.1.

Solve the following linear equation :

2x1 x2 + x3 = 5
x1 + 2x2 + 3x3 =10
x1 + 3x2 2x3 = 7
(Use Gauss Seidel Method)

Ans.: Above system of equations can be written as :

2x1 x2 + x3 = 5

_ _ _ (1)

x1 + 3x2 2x3 = 7

_ _ _ (2)

x1 + 2x2 + 3x3 =10

_ _ _ (3)

Iterative equations are :

x1(n+1) =

1
(n)
[5 + x (n)
2 x3 ]
2

_ _ _ (4)

x (n+1)
=
2

1
(n+1)
(n)
[7 x1 + 2 x3 ]
3

_ _ _ (5)

x3(n+1) =

1
(n+1)
(n+1)
[10 x1 2 x 2 ]
3

_ _ _ (6)

Taking initial approximations as :

x1(0) = 0

x(0)
2 = 0

and

x3(0) = 0

For free study notes log on: www.gurukpo.com

64
First approximation is :
x1(1) =

=
x(1)
2 =

=
x3(1) =

1
(0)
[5 + x (0)
2 x3 ]
2
1
5
[5 + 0 0] =
= 2.5
2
2

1
[7 x1(1) + 2 x3(0) ]
3
1
[7 2.5 + 2
3

0] =

1
(4.5) = 1.5
3

1
[10 x1(1) 2 x (1)
2 ]
3

1
[10 2.5 2
3

1.5] = 1.5

Now second approximation :

x1(2) =

=
x(2)
2 =

=
x3(2) =

=
x1(3) =

1
(1)
[5 + x (1)
2 x3 ]
2
1
[5 + (1.5) 1.5] = 2.5
2
1
[7 x1(2) + 2 x3(1) ]
3
1
[7 2.5 + 2 (1.5)] = 2.5
3
1
(2)
(2)
[10 x1 2 x 2 ]
3
1
[10 2.5 2
3

2.5] = 0.8333

1
(2)
[5 + x (2)
2 x3 ]
2
1
[5 + 2.5 0.8333] = 3.3333
2

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

x(3)
2 =

=
x3(3) =

1
[7 x1(3) + 2 x3(2) ]
3
1
[7 3.3333 + 2
3

0.8333] = 1.7777

1
[10 x1(3) 2 x (3)
2 ]
3
1
[10 3.3333 2
3

x1(3) = 3.3333

x1(4) =

65

1.7777] = 1.0371

x(3)
2 = 1.7777

x3(3) = 1.0371

x3(4) = 0.9980

1
(3)
[5 + x (3)
2 x3 ]
2
1
[5 + 1.7777 1.0371] = 2.8703
2

x(4)
= 2.0679
2

x3(4) = 0.9980
x1(4) = 2.8703

x(4)
2 = 2.0679

Now x1(5) = 3.035

x(5)
2 = 1.9870
x3(5) = 0.9970

x1(6) = 2.9950
x(6)
2 = 1.9997
x3(6) = 1.0019

For free study notes log on: www.gurukpo.com

66
x1(7) = 2.9989
x(7)
2 = 2.0016
x3(7) = 0.9993

x1(8) = 3.0011
x(8)
2 = 1.9991
x3(8) = 1.0002

x1(9) = 2.9994
x(9)
2 = 2.0003

x3(9) = 1

x1(10) = 3.0001
x (10)
2 = 1.9999

x 3(10) = 1

x1(11) = 2.9999
x (11)
2 = 2
x 3(11) = 1

x1(12) = 3
x (12)
2 = 2

x 3(12) = 1

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

67

x1(13) = 3
x (13)
2 = 2
x 3(13) = 1

Hence the solution of the given system of linear equation is :

x1 = 3

x2 = 2

x3 = 1

For free study notes log on: www.gurukpo.com

68

Chapter-13

Forward Difference
Q.1.

Construct a forward difference table for the following given data.

x

3.60

3.65

3.70

3.75

36.598

38.475

40.447

42.521

Ans.:
x

2y

3.60

36.598

1.877

0.095

3.65

38.475

1.972

0.102

3.70

40.447

2.074

3.75

42.521

3y

0.007

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

69

Chapter-14

Backward Difference
Q.1.

Construct a backward difference table form the following data :

sin 30 = 0.5000,

sin 35 = 0.5736,

sin 40 = 0.6428, sin 45 = 0.7071

Assuming third difference to be constant find the value of sin 25 .

Ans.:
x

25

2y

3y

y30 =?
30

0.5000

2y35

=?

0.0736
35

0.5736

3y40

-0.0044
0.0692

40

0.6428

-0.0005
-0.0049

0.0643
45

0.7071

Since we know that

3y40

3y

should be constant so

= 0.0005

2y40

-0.0044

2y35

= 0.0005

2y35 =

=?

0.0005

For free study notes log on: www.gurukpo.com

70
2y35

= +0.0005 0.0044
= -0.0039

Again

2y35 =

0.0039

y35 y30 = -0.0039

0.0736 y30 = 0.0039
y30 = 0.0039 + 0.0736
= 0.0775
Again y30 = 0.0775
y30 y25 = 0.0775
0.5000 y25 = 0.0775
y25 = 0.5000 0.0775
= 0.4225
Hence sin 25 = 0.4225

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

71

Chapter-15

Newton Gregory Formula for Forward

Interpolation
Q.1.

Use Newton formula for interpolation to find the net premium at the age 25
from the table given below :
Age

20

24

28

32

Annual net premium

0.01427

0.01581

0.01772

0.01996

Ans.:
Age (x)

(x)

20

0.01427

(x)

2(x)

3(x)

0.00154
24

0.01581

0.00037
0.00191

28

-0.00004

0.01772

0.00033
0.00224

32

0.01996

Here a = 20

h=4

and

x = a + hu

x = a + hu
25 = 20 + 4
5 = 4u

u = 1.25

For free study notes log on: www.gurukpo.com

72
Using following Newtons Gregory forward interpolation formula :
(a + hu) = (a) +

u (2)
(a) +
2!

u(1)

2(a)

(25) = 0.01427 + 1.25 (0.00154) +

u (3)
+
3!

3(a)

+_____

1.25 (0.25)
1.25 (0.25) ( 0.75)
(0.00037) +
1 2
1 2

(-0.00004)
(25) = 0.01427 + 0.001925 + 0.0000578 + 0.0000015 = 0.0162543
Q.2.

From the following table find the number of students who obtained less
than 45 marks :
Marks
No. of Students
30 40
31
40 50
42
50 60
51
60 70
35
70 80
31

Ans.:
Marks (x)

No. of
Students (x)

Less than 40

31

(x)

2(x)

3(x)

4(x)

42
Less than 50

73

9
51

Less than 60

124

-25
-16

35
Less than 70

159

37
12

-4
31

Less than 80

190

Here a = 40
40 + 10

h = 10

and

u = 45

For free study notes log on: www.gurukpo.com

a + hu = 45

Mathematical Methods for Numerical Analysis and Optimization

73

10u = 5
1
2

u=

using following forward interpolation formula :

(x) = (a) + u(1) (a) +

u (2)
2!

2(a)
1

1
1

(40) +

3(a)

+_____

1
1

2(40)

2!

3(40)

3!

1
2

u (3)
3!

1
(45) = (40) +
2
1

4(40)

4!
1

1
2
2
2
(42) + 2 2 (9) + 2 2
(-25) + 2 2
(37)
2
1 2
1 2 3 4
1 2 3
= 31 + 21 1.125 1.5625 1.4453
= 47.8672 = 48 (approximately)
Hence the no. of students who obtained less than 45 marks are 48.

= 31 +

Q.3.

Find the cubic polynomial which takes the following values

x

(x)

10

Find (4)
Ans.: Here we know that a = 0, h = 1 then form Newtons Gregory forward
interpolation formula.
Pn (x) = (0) + xc1 (0) + xc2

2(0)

+ _ _ _ xcn

n(0)

_ _ _ _ (1)

For free study notes log on: www.gurukpo.com

74
(x)

(x)

(x)

2(x)

3(x)

-1
1

2
1

8
9

10

(4) 27 = 6
(4) 19

(it should be constant)

(4) 10
4

(4)
Substituting the values in equation (1) from above table :
P3 (x) = 1 + x (-1) +

x(x 1)
x(x 1)(x 2)
(2) +
(6)
1 2
1 2 3

P3 (x) = 1 x + x2 x + x3 3x2 + 2x
= x3 2x2 + 1
Hence the required polynomial of degree three is
x3 2x2 + 1
Again (4) 27 = 6
(4) = 33

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

75

Chapter-16

Newtons Formula for Backward

Interpolation
Q.1.

The population of a town in decennial census was as given below :

Year

1891

1901

1911

1921

1931

Population (in thousands)

46

66

81

93

101

Estimate the population for the year 1925.

Ans.:
Year
(x)

Population
(in thousand)
(x)

1891

46

(x)

2(x)

3(x)

4(x)

20
1901

66

-5
15

1911

81

2
-3

12
1921

93

-3
-1

-4
8

1931

101

For free study notes log on: www.gurukpo.com

76
Here x = 1925,

h = 10 ,

a = 1891

and

a + nh = 1931

(a + hn) + uh = 1925
1931 + uh = 1925
uh =

1925 1931
= -0.6
10

Now using Newtons Backward interpolation formula :

(a + nh + uh) = (a + nh) +
4(a

(a + nh) + _ _ _ _ +

u(u + 1) (u + 2) (u + 3)
4!

+ nh)

(1925) = 101 + (-0.6)

+

u
1!

8+

(-0.6) (0.4) (1.4) (2.4)

(-3)
4!

(-0.6) (0.4) (1.4)

( 0.6)(0.4)
(- 4) +
(- 1)
2!
3!

= 101 4.8 + 0.48 +0.056 0.1008

= 96.6352 thousand (approximately)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

77

Chapter-17

Divided Difference Interpolation

Q1.

Construct a divided difference table from the following data :

x

12

(x)

22

30

82

106

216

Ans.:
x

(x)

22

(x)

2(x)

3(x)

4(x)

30 22
=8
2 1

30

26 8
=6
4 1
82 30
= 26
4 2

82

( 3.6 6)
= -1.6
7 1

8 26
= -3.6
7 2

0.535 ( 1.6)
12 1

= 0.194
106 82
=8
7 4

1.75 ( 3.6)
=
12 2
0.535

For free study notes log on: www.gurukpo.com

78
x

(x)

106

(x)

2(x)

3(x)

4(x)

22 8
= 1.75
12 4
216 106
12 7

= 22
12

Q.2.

216

By means of Newtons divided difference formula find the value of (2),

(8) and (15) from the following table :
x

10

11

13

(x)

48

100

294

900

1210

2028

Ans.: Newtons divided difference formula for 4, 5, 7, 10, 11, 13 is :

(x) = (4) + (x 4)

(x) + (x 4) (x 5)

+ (x 4) (x 5) (x 7)(x 10)

4
5,7,10,11

2
5,7

(4) + (x 4) (x 5) (x 7)

(4) + _ _ _ _ _ _ _

3
5,7,10

(4)

_ _ _ (1)

So constructing the following divided difference table :

x

(x)

48

(x)

2(x)

3(x)

100 48
= 52
5 4

100

97 52
= 15
7 4
294 100
= 97
7 4

21 15
=1
10 4

For free study notes log on: www.gurukpo.com

4(x)

Mathematical Methods for Numerical Analysis and Optimization

x

(x)

294

(x)

2(x)

4(x)

900

27 21
=1
11 5

310 202
= 27
11 7
1210 900
= 310
11 10

11

3(x)

202 97
= 21
10 5
900 294
= 202
10 7

10

79

1210

33 27
=1
13 7
409 310
= 33
13 10

2028 1210
= 409
13 11

13

2028

Substituting the values from above table in equation (1)

(x) = 48 + 52 (x 4) + 15 (x 4) (x 5) + (x 4) (x 5) (x 7)
= x2 (x 1)

_ _ _(2)

Now substituting x = 2, 8 and 15 in equation (2)

(2) = 4 (2 -1) = 4
(8) = 64 (8 1) = 448
(15) = 225 (15 1) = 3150
Q.3.

Find the polynomial of the lowest possible degree which assumes the
values 3, 12, 15, -21 when x has values 3, 2, 1, -1 respectively.

For free study notes log on: www.gurukpo.com

80
Ans.: Constructing table according to given data
x

(x)

-1

-21

(x)

2(x)

3(x)

18
1

15

-7
-3

12

1
-3

-9
3

Substituting the values in Newtons divided difference formula :

(x) = (x0) + (x x0) (x0, x1) + (x x0) (x x1) _ _ _ (x xn-1) + (x0, x1, x2 ..xn)
= -21 + {x (-1)} 18 + { x (-1)} (x 1) (-7) + {x (-1)} (x 1) (x 2) (1)
= x3 9x2 + 17x + 6

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

81

Chapter-18

Lagranges Interpolation
Q.1.

Given that
(1) = 2 ,

(2) = 4 ,

(3) = 8 ,

(4) = 16 ,

(7) = 128

Find the value of (5) with the help of Lagranges interpolation formula.
Ans.: According to question
x0 = 1,

x1 = 2,

x2 = 3,

x3 = 4,

x4 = 7,

(x0) = 2,

(x1) = 4,

(x2) = 8,

(x3) = 16,

and

and
(x4) = 128,

Using Lagranges formula for x = 5

(5) =

(5 2)(5 3)(5 4)(5 7)

(1 2)(1 3)(1 4)(1 7)

2+

(5 1)(5 3)(5 4)(5 7)

4
(2 1)(2 3)(2 4)(2 7)

(5 1)(5 2)(5 4)(5 7)

(3 1)(3 2)(3 4)(3 7)

8+

(5 1)(5 2)(5 3)(5 4)

(7 1)(7 2)(7 3)(7 4)

128

2
3

32
128 128
24
5
3
15

(5 1)(5 2)(5 3)(5 7)

16
(4 1)(4 2)(4 3)(4 7)

494
15

= 32.93333
Hence (5) = 32.9333
Q.2.

Find the form of function given by the following table :

x

-1

(x)

12

15

-21

For free study notes log on: www.gurukpo.com

82
Ans.: According to question
x0 = 3,

x1 = 2,

x2 = 1

and

x3 = - 1

(x0) = 2,

(x1) = 12,

(x2) = 15

and

(x3) = -21

Now substituting above values in Lagranges formula :

(x) =

(x 2)(x 1)(x + 1)
(3 2)(3 1)(3 1)

(x 3)(x 1)(x + 1)
12
(2 3)(2 1)(2 1)

3+

(x 3)(x 2)(x +1)

(1 3)(1 2)(1 1)

15 +

(x 3)(x 2)(x 1)
( 1 3)( 1 2)( 1 1)

21

3 3
15 3
7
(x 2x2 x + 2) -4 (x3 3x2 x + 3) +
(x 4x2 + x + 6) +
8
4
8
(x3 6x2 + 11x 6)

(x) = x3 9x2 + 17x + 6

Q.3.

By means of Lagranges formula prove that :

y0 =

1
1 1
1
(y1 + y-1) - [ (y3 y1) - (y-1 y-3)]
2
8 2
2

Ans.: Here we are given y-3, y-1 y1 and y3 and we have to evaluate y0.
Using Lagranges formula
(0 1)(0 1)(0 3)
y
( 3 1)( 3 1)( 3 3)

y0 =

(0 3)(0 1)(0 3)
y
( 1 3)( 1 1)( 1 3)

(0 3)(0 1)(0 3)
(0 3)(0 1)(0 3)
y1 +
y3
(1 3)(1 1)(1 3)
(3 3)(3 1)(3 1)

1
y
16

1
y1
2

1
16

1
y1
2

1 1
y3 - y1
8 2

9
y
16

9
1
y1
y3
16
16
y3 - y1

y 1- y

1
y 1- y
2

Hence proved.

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

83

Chapter-19

Spline Interpolation
Q.1.

Given the set of data points (1, 8), (2, 1) and (3, 18) satisfying the
function y = (x). find the linear splines satisfying the given data.
Determine the approximate values of y(2.5) and y1(2.0).

Ans.: Let the given points be A (1, 8), B (2, 1) and C (3, 18) equation of AB is
s1 (x) = -8 + (x 1) 7

[si(x) = yi-1 + mi (x xi-1)]

= -8 + 7x 7
= 7x -15
And equation of BC is
s2 (x) = -1 + (x 2) (19)
= -1 + 19x -38
= 19x 39

_ _ _ (1)

Since x = 2.5 belongs to the interval [2, 3] we have

y (2.5) = s2 (2.5) = -19(2.5) -39 = 8.5
And

y1(x) = +19

[from equation (1)]

Here we note that the splines si (x) are continuous in the interval [1, 3] but
their slopes are discontinuous.

For free study notes log on: www.gurukpo.com

84

Chapter-20

Quadratic Splines
Q.1.

Given the set of data points (1, 8), (2, 1) and (3, 18) satisfying the
function y = (x). find the quadratic splines satisfying the given data. Find
also the approximate values of y(2.5) and y' (2.0).

Ans.: Since we know that

mi-1 + mi =

2
(yi - yi-1)
hi

[i = 1, 2 . n]

we have h = 1
taking i = 1
m0 + m1 = 14
taking i = 2
m1 + m2 = 38
Since m0 = m1 we obtain m0 = m1 = 7 and m2 = 31 using following equation
si (x) =
s2 (x) =
=

1
hi

( xi

x) 2
2

( x 2 x) 2
m1
2

mi-1

(x xi-1 )2
mi
2

(x x1 ) 2
m2
2

y1

yi-1

hi
mi-1
2

1
m1
2

(3 x) 2
(x 2) 2
7
(7)
(31) 1
2
2
2

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

=

(3 x)2
31
(7)
( x 2)2
2
2

85

5
2

= 12x2 41x + 33
Since 2.5 lies in the interval [2, 3]
Hence
y (2.5) = s2 (2.5)
= 12(2.5)2 41 (2.5) + 33
= 12

6.25 41

2.5 + 33

= 5.5
y' (x) = 24x 41
y' (2) = 24

2 41

= 48 41
= 7.0

For free study notes log on: www.gurukpo.com

86

Chapter-21

Cubic Splines
Q.1.

Given the set of data points (1, 8), (2, 1) and (3, 18) satisfying the
function y = (x). find the cubic splines satisfying the given data.
Determine the approximate values of y (2.5) and y' (2.0).

Ans.: We have n = 2 and p0 = p2 = 0 therefore from the following relation :

pi 1 + 4pi + pi+1 =

6
(yi
h2

2yi + yi 2 )

(i 1, 2......n 1)

gives
p1 = 18
If s1 (x) and s2 (x) are respectively, the cubic splines in the intervals 1
and 2 x 3, we obtain

s1 (x) = 3 (x - 1)3 8 (2 x) 4 (x 1)
and

s2 (x) = 3 (3 x)3 + 22x 48

We therefore have
y(2.5) = s2 (2.5) =
and

3
+ 7 = 7.375
8

y1 (2.0) = s2 (2.0) = 13.0

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

87

Chapter-22

Numerical Differentiation
Q.1.

From the following table of values of x and y obtain dy/dx and d 2y/dx2 at x
= 1.1.
x

1.0

1.2

1.4

1.6

1.8

2.0

0.00

0.1280

0.5440

1.2960

2.4320

4.00

Ans.: According to given question,

h = 0.2, a = 1 and x = 1.1
Here 1.1 is close to the initial value so using Newton-Gregory forward
difference formula.
x

y = (x)

0.00

2y

3y

4y

0.1280
1.2

0.1280

0.2880
0.4160

1.4

0.5440

0.0480
0.3360

0.7520
1.6

1.2960

0.0480
0.3840

1.1360
1.8

2.4320

0
0.0480

0.4320
1.5680

2.0

4.0000

For free study notes log on: www.gurukpo.com

88
Newtons Gregory forward formula is :
(a + xh) = (a) + xc1 (a) + xc2
or (a + xh) = (a) + x (a) +

x2 x
2

2(a)

2(a)

+ xc3

x3 3x 2
6

3(a)

2x

+ ...
3(a)

+ . _ _ _ (1)

Differentiating both sides of the equation (1) w. r. t. x

hf' (a + xh) = (a) +

(2x 1)
2

2(a)

3x 2 6x 2
6

3(a)

_ _ _ (2)

Again differentiating equation (2) w. r.t. x

h2f' (a + xh) =

2(a)

+ (x 1)

3(a)

+ .

_ _ _ (3)

Here we have to find f' (1.1) and f'' (1.1)

Substituting a = 1, h = 0.2 and x =
0.2f' (1.1) = 0.1280 + 0 +

1
6

1
in equation (2) and (3)
2
1
1
6
2 (0.0480) + 0
4
2

Hence f' (1.1) = 0.630

And

_ _ _ (4)

(0.2)2 f'' (1.1) = 0.2880 +

1
1 (0.0480) + 0 = 0.264
2

Hence f'' (1.1) = 6.60

Q.2.

_ _ _ (5)

Using divided difference find the value of f' (8) given that :
x

12

(x)

1.556

1.690

1.908

2.158

Ans.:
x

y = (x)

x0 = 6

1.556

2y

0.134

For free study notes log on: www.gurukpo.com

3y

Mathematical Methods for Numerical Analysis and Optimization

x

y = (x)

x1 = 7

1.690

2y

3y

- 0.0083
0.109

x2 = 9

89

0.00051

1.908

-0.0052
0.083

x3 = 12

2.158

Newtons divided difference formula is

(x) = (x0) + (x x0) (x0) + (x x0) (x x1)
3(x0)

+ (x x0) (x x1) (x x2) (x x3)

2(x0)
4(x0)

+ (x x0) (x x1) (x x2)

_ _ _ (1)

Differentiating both sides of equation (1) w. r.t. x

f'(x) =

(x0) + (2x x0 x1)

2(x0)

[3x2 2x (x0 + x1 + x2) + x0x1 + x1x2 + x0x2]

3(x0)

_ _ _ (2)

Now substituting x = 8, x0 = 6, x1 = 7, x2 = 9, x3 = 12 in equation (2)

f1(8) = 0.134 + [2
[3

64 2

8 6 7 ] (-0.0083) +
8 (6 + 7 +9) + 6

7+7

9+6

9](0.00051)

= 0.134 0.0249 + (192 352 + 159) (0.00051)

= 0.10859

For free study notes log on: www.gurukpo.com

90

Chapter-23

Numerical Integration
Q.1.

Compute the value of following integral by Trapezoidal rule.

1. 4

(sin x

log x + ex ) dx
e

0.2

Ans.: Dividing the range of integration in equal intervals in the interval [0.2, 1.4]
1.4 0.2
6

1.2
6

0.2 h

sin x

log x

ex

y = sin x log +ex

0.2

0.19867

-1.6095

1.2214

y0 = 3.0296

0.4

0.3894

-0.9163

1.4918

y1 = 2.7975

0.6

0.5646

-0.5108

1.8221

y2 = 2.8975

0.8

0.7174

-0.2232

2.2255

y3 = 3.1661

1.0

0.8415

0.0000

2.7183

y4 = 3.5598

1.2

0.9320

0.1823

3.3201

y5 = 4.0698

1.4

0.9855

0.3365

4.0552

y6 = 4.7042

Using following trapezoidal rule

1. 4

I=

(sin x
0.2

log x + ex ) dx
e

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

=

h
[(y0 + y6) + 2 (y1 + y2 + y3 +y4 +y5)]
2

0.2
[7.7338 + 2 (16.4907)]
2

= 4.07152
5.2

Q.2.

Calculate the value of the integral

4

1
log x dx by Simpsons rule.
e
3

Ans.: First of all dividing the interval [4 5.2] in equal parts.

5.2 4
6

1.2
6

xi

0.2 h

yi = log x = log x
e

10

2.30258

4.0

y0 = 1.3862944

4.2

y1 = 1.4350845

4.4

y2 = 1.4816045

4.6

y3 = 1.5260563

4.8

y4 = 1.5686159

5.0

y5 = 1.6049379

5.2

y6 = 1.6486586

1
Using following Simpsons rule :
3
h
I = [(y0 + y6) + 4 (y1 + y3 + y5) +2 (y2 +y4)]
3

0.2
[3.034953 + 18.232315 + 6.1004408]
3

0.2
[27.417709] = 1.8278472
3

For free study notes log on: www.gurukpo.com

91

92
1

Q.3.

Evaluate
0

3
dx
using Simpsons rule :
2
8
1+ x

Ans.: Dividing the interval [0, 1] into six equal intervals.

1 0
6

1
6

y= h

1
(1 x 2 )

x0 = 0

y0 = 1.000

x0 + h = 1/6

y1 = (36/37) = 0.97297

x0 + 2h = 2/6

y2 = (36/40) = 0.90000

x0 + 3h = 3/6

y3 = (36/45) = 0.80000

x0 + 4h = 4/6

y4 = (36/52) = 0.69231

x0 + 5h = 5/6

y1 = (36/61) = 0.59016

x0 + 6h = 1

y6 = (1/2) = 0.50000

Using following Simpsons 3/8 rule.

x0 +nh

ydx=
x0

ydx =
0

3h
(y0 + y n )+3(y1 + y 2 + y 4 + y5 +......)+2(y3 + y6 +.......)
8

1
(1+ 0.5) + 3 (0.97297 + 0.9 + 0.69231 + 0.59016) + 2 (0.8)
16
1
[1.5 + 9.46632 + 1.6]
16

= 0.785395

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

93

Chapter-24

Numerical Solution for Differential

Equations [Eulers Method]
Q.1.

Use Eulers Method to determine an approximate value of y at x = 0.2 from

dx
initial value problem
= 1 x + 4y y(0) = 1 taking the step size
dy
h = 0.1.

Ans.: Here h = 0.1, n = 2, x0 = 0, y0 = 1

Given

dx
= 1 x + 4y
dy

Hence y1 = y0 + h(x0, y0)

= 1 + 0.1 [1 x0 + 4y0]
= 1 + 0.1 [1 0 + 4

1]

= 1 + 0.1 [1 + 4]
= 1 + 0.5

= 1.5
Similarly y2 = y1 + h(x0 + h, y1)
= 1.5 + 0.1[1 0.1 + 4

1.5]

= 2.19

For free study notes log on: www.gurukpo.com

94
Q.2.

Using Eulers Method with step-size 0.1 find the value of y(0.5) from the
dx
following differential equation
= x2 + y2 , y(0) = 0
dy

Ans.: Here h = 0.1, n = 5, x0 = 0, y0 = 0 and (x, y) = x2 + y2

Hence y1 = y0 + h(x0, y0)
= 0 + (0.1) [02 + 02]
=0
Similarly y2 = y1 + h(x0 + h, y1)
= 0 + (0.1) [(0.1)2 +02]
= (0.1)3
= 0.001
y3 = y2 + hf[x0 + 2h, y2]
= 0.001 + (0.1) [(0.2)2 +(0.001)2]
= 0.001 + 0.1 [0.04 + 0.00001]
= 0.001 + 0.1 [0.040001]
= 0.005
y4 = y3 + hf[x0 + 3h, y3]
= 0.005 + (0.1) [(0.3)2 +(0.005)2]
= 0.005 + (0.1) [0.09 + 0.000025]
= 0.014
y5 = y4 + hf[x0 + 4h, y4]
= 0.014 + (0.1) [(0.4)2 +(0.014)2]
= 0.014 + (0.1) [0.16 + 0.00196]
= 0.031
Hence the required solution is 0.031

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

95

Chapter-25

Numerical Solution for Differential

Equations [Eulers Modified Method]
Q.1.

Using Eulers modified method, obtain a solution of the equation

dy
x+| y | with initial conditions y = 1 at x = 0 for the range 0 x 0.6 in
dx
the step of 0.2. Correct upto four place of decimals.

Ans.: Here (x, y) = x + | y|

x0 = 0 , y0 = 1 , h = 0.2 and xn = x0 + nh
(i)

At x = 0.2
First approximate value of y1
y1(1) = y0 + h(x0, y0)
= 1 + (0.2) [0 + 1]
= 1.2
Second approximate value of y1
y1(2) = y0 +
=1+

h
[(x0, y0) + (x1, y1(1))]
2

0.2
[(0 + 1) + {0.2 + 1.2 }]
2

= 1.2295

For free study notes log on: www.gurukpo.com

96
Third approximate value of y1
y1(3) = y0 +
=1+

h
{(x0, y0) + (x1, y1(2))}
2
0.2
[(0 + 1) + {0.2 + 1.2295 }]
2

= 1 + 0.1 [1 + 1.30882821]
= 1.2309
Fourth approximate value of y1
y1(4) = y0 +
=1+

h
{(x0, y0) + (x1, y1(3))}
2
0.2
[(0 + 1) + (0.2 + 1.2309 )]
2

= 1 + 0.1 [1 + 1.30945]
= 1.2309
Since the value of y1(3) and y1(4) is same
Hence at x1 = 0.2, y1 = 1.2309
(ii)

At x = 0.4
First approximate value of y2
y2(1) = y1 + h(x1, y1)
= 1.2309 + (0.2) {0.2 + 1.2309 }
= 1.4927
Second approximate value of y2
y2(2) = y1 +

h
[(x1, y1) + (x2, y2(1))]
2

= 1.2309 +

0.2
[(0.2 + 1.2309 ) + (0.4+ 1.4927 )]
2

= 1.2309 + 0.1 [1.309459328 + (1.621761024]

= 1.5240

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Third approximate value of y2
y2(3) = y1 +

h
[(x1, y1) + (x2, y2(2))]
2

= 1.2309 +

0.2
[(1.309459328 + (0.4 + 1.5240 )]
2

= 1.2309 + 0.1 [1.309459328 + 1.634503949]

= 1.5253
Fourth approximate value of y2
y2(4) = y1 +

h
{(x1, y1) + (x2, y2(3))}
2

= 1.2309 +

0.2
[(0.2 + 1.2309 ) + (0.4 + 1.5253 )]
2

= 1.2309 + 0.1 {1.309459328 + 1.635030364]

= 1.5253
Hence at x = 0.4, y2 = 1.5253
(ii)

At x = 0.6
First approximate value of y3
y3(1) = y2 + h(x2, y2)
= 1.5253 + 0.2 [0.4 + 1.5253 ]
= 1.8523
Second approximate value of y3
y3(2) = y2 +

h
{(x2, y2) + (x3, y3(1))}
2

= 1.5253 +

0.2
[(0.4 + 1.5253 ) + (0.6+ 1.8523 )]
2

= 1.8849

For free study notes log on: www.gurukpo.com

97

98
Third approximate value of y3
y3(3) = y2 +

h
{(x2, y2) + (x3, y3(2))}
2

= 1.5253 +

0.2
[(0.4 + 1.5253 ) + (0.6 + 1.8849 )]
2

= 1.8851
Fourth approximate value of y3
y3(4) = y2 +

h
{(x2, y2) + (x3, y3(3))}
2

= 1.5253 +

0.2
[(0.4 + 1.5253 ) + (0.6 + 1.8851 )]
2

= 1.8851
Hence at x = 0.6, y3 = 1.8851

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

99

Chapter-26

Numerical Solution for Differential

Equations [Runge Kutta Method]
Q.1.

Using Runge Kutta method find an approximate value of y for x = 0.2 in

dy
step of 0.1 if
x + y 2 given y = 1 when x = 0
dx

Ans.: Here (x, y) = x + y2, x0 = 0, y0 = 1 and h = 0.1

K1 = h(x0, y0) = 0.1[0 + 1]
= 0.1 .

_ _ _ (1)

1
1
K2 = h(x0 + h, y0 + K1)
2
2
= 0.1

1
(0.1)
2

1
0.1152
2

= 0.1152
K3 = h(x0 +
= 0.1

_ _ _ (2)
1
1
h, y0 + K2)
2
2

1
0
(0.1)
2

= 0.1168

1
0.1152
2

_ _ _ (3)

For free study notes log on: www.gurukpo.com

100
K4 = h(x0 + h, y0 +K3)
= 0.1 0 0.1

1 0.1168

= 0.1347

_ _ _ (4)

and

1
(K1 +2K2 +2K3 +K4)
6
1
=
0.1 2(0.1152) 2(0.1168) 0.1347
6

K=

{using equation (1), (2),

(3) and (4)}

= 0.1165
Hence y1 = y0 + K = 1 + 0.1165
= 1.1165

_ _ _ (5)

Again x1 = x0 + h = 0.1, y1 = 1.1165, h = 0.1

Now
K1 = h(x1, y1)
= 0.1 0.1 (1.1165)2
= 0.1347
1
h, y1
2

K2 = hf x1
= 0.1

_ _ _ (6)

0.1

1
K1
2

1
(0.1)
2

1.1165

1
(0.1347)
2

= 0.1551
1
h, y1
2

K3 = hf x1
= 0.1

_ _ _ (7)
1
K2
2

1
0.1
(0.1)
2

= 0.1576

1
1.1165
(0.1551)
2

_ _ _ (8)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

101

K4 = hf x1 h, y1 K3
= (0.1) 0.1 0.1

1.1165 0.1576

= 0.1823

_ _ _ (9)

and
K=
=

1
(K1 +2K2 +2K3 +K4)
6
1
0.1347 2(0.1551) 2(0.1576) 0.1823
6

{using equation (6), (7),

(8) and (9)}

= 0.1570
Hence
y(0.2) = y2 = y1 + K
= 1.1165 + 0.1570
= 1.2735
which is required solution.
Q.2.

Use Runge-Kutta method to solve y' = x y for x = 1.4. Initially x = 1, y = 2

(tale h = 0.2).
[BCA Part II, 2007]
Ans.: (i)
Here (x, y) = xy, x0 = 1, y0 = 2, h = 0.2
K1 = h(x0, y0)
= 0.2[ 1

2]

= 0.4

K
h
K2 = h(x0 + , y0 + 1 )
2
2
= 0.2 1

0.2
0.4
2
2
2

For free study notes log on: www.gurukpo.com

102
= 0.2 1 0.1 2 0.2
= 0.2 1.1 2.2
= 0.484

K
h
K3 = h(x0 + , y0 + 2 )
2
2
= 0.2 1

0.2
0.484
x 2
2
2

= 0.49324
K4 = h(x0 +h, y0 +K3)
= 0.2 1 0.2 2 0.49324
= 0.5983776
K=
=

1
(K1 +2K2 +2K3 +K4)
6
1
0.4 2(0.484) 2(0.49324) 0.5983776
6

= 0.4921429
y1 = y 0 + K
= 2 + 0.4921429
= 2.4921429
(ii)

x1 = x0 + h = 1 + 0.2 = 1.2, y1 = 2.4921429 and h = 0.2

K1 = h(x1, y1)
= 0.2[(1.2) (2.4921429)]
= 0.5981143
K
h
K2 = h(x1 + , y1 + 1 )
2
2

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

= 0.2 1.2

103

0.2
0.5981143
2.4921
2
2

= 0.81824
K
h
K3 = h(x1 + , y1 + 2 )
2
2

= 0.2 1.2

0.2
0.81824
2.4921
2
2

= 0.7543283
K4 = h(x0 +h, y0 +K3)
= 0.2 1.2 0.2 2.4921 0.7543
= 0.9090119
K=

1
(K1 +2K2 +2K3 +K4)
6

= 0.7753
y2 = y 1 + K
= 2.4921 + 0.7753
= 3.26752
y (1.4) = 3.26752

For free study notes log on: www.gurukpo.com

104

Chapter-27

Boundary Valve Problem Shooting Method

Q.1

Solve the Boundary Value Problem y'' (x) = y (x) ; y(0) = 0 ; y(1) = 1.1752 by
the shooting method taking m0 = 0.7 and m1 = 0.8

Ans.: By Taylors Series

y(x) = y(0) + xy'(0) +

x 4 IV
x5 V
x2
x3
x 6 VI
y''(0) +
y'''(0) +
y (0) +
y (0) +
y (0) +
24
120
2
6
720

_ _ _ (1)

Since y''(x) = y(x) we have

y''(x) = y'(x)
and

yIV(x) = y''(x) = y(x)

yV(x) = y'(x)
yVI(x) = y''(x) = y(x) .

Putting x = 0 in above we get

y''(0) = y(0) = 0

y'''(0) = y'(0)

yIV(0) = 0

y''(0) = y'(0)

Substituting these values in equation (1)

y(x) =

yI(0)

x3
x
6

x5
x7
x9
.......
120 5040 362800

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

105

Since y(0) = 0
Hence y(1) = y'(0) x

1 1
6 120

1
...........
5040

= y'(0)(1.1752)
_ _ _ (2)
With y'(0) = m0 = 0.7
So equation (2) gives
y(1) 0.8226
Similarly y'(0) = m0 = 0.8 gives
y(1) 0.9402
Using linear interpolation, we obtain
m2 = 0.7 + (0.1)

1.1752 0.8226
0.9402 0.8226

= 0.9998
Which is closer to exact value of y'(0) = 1 with this value of m2, we solve the
initial value problem y''(x) = y(x), y(0) = 0, y'(0) = m2
_ _ _ (3)
and continue the process as above until the value of y(1) is obtained to the
desired accuracy.

For free study notes log on: www.gurukpo.com

106

Multiple Choice Questions

1. The second divided different of the function f(x) = for the arguments a,b,c is given

by:

(a)
(b)
(c)
(d)
2. Which method is a successive approximation method, which starts from an approximation
to the true solution and, if convergent, the cycles of computations being repeated
till the required accuracy is obtained:
(a)
Matrix inversion method
(b)
Matrix factorization method
(c)
Gauss -= elimination method
(d)
Guass-Seidel method
3. If x = 0.555 E01, y= 0.4545 E01 and z=0.4535 E01. Then the value of x (yz) is equal to:
(a)
0.5000 E 01
(b)
0.555 E 01
(c)
0.5454 E 01
(d)
0.5555 E01
4. The logical and concise list of procedure for solving a problem is known as:
(a)
Iterative procedure
(b)
Approximation method
(c)
Series procedure
(d)
Algorithm

( )

5. If a positive decimal number be represented in a normalized floating point mode, then the
true statement is:
(a)
0 mantissa < 1
(b)
0.1 mantissa < 1
(c)
0.1 mantissa < 0
(d)
0.< mantissa 0.1
6. Which of the following stands for divided difference?
(a)

f (x0 , x) =

(b)

f (x0 , x) =

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(c)

f (x0 , x) =

(d)

f (x0 , x) =

7. The equation x3 7x2 + 8x + 2 = 0 may have at the most:

(a)
three positive roots
(b)
five positive roots
(c)
two positive roots
(d)
four positive roots
8. The approximate value of y of the solution of:
= x + y, when y (0) = 1 by Runge-Kutta method when k1 = 0.2000,
k2 = 0.2400, k3 = 0.2440, k4 = 0.2888 is :
(a)
1.2002
(b)
1.2428
(c)
0.2482
(d)
0.2428
9. The root of the equation x3 9x+1 = 0 lies between the interval:
(a)
(1,2)
(b)
(2,3)
(c)
(1,2)
(d)
(3,4)
10. For the solution of differential equation which of the following methods is not used:
(a)
Runge- Kutta Method
(b)
Shooting method
(c)
Cubic spline method
(d)
Euler's method
11. For the solution of differential equation which of the following methods is not used:
(a)
Runge- Kutta Method
(b)
Shooting method
(c)
Cubic spline method
(d)
Euler's method
12. The approximate value of y of the solution of:
= x + y, when y (0) = 1 by Runge-Kutta method when k1 = 0.2000,

For free study notes log on: www.gurukpo.com

107

108
k2 = 0.2400, k3 = 0.2440, k4 = 0.2888 is :
(a)
1.2002
(b)
1.2428
(c)
0.2482
(d)
0.2428
13.

In which of the following method, pivoting is used:

(a)
Euler's method
(b)
Gauss Seidel Method
(c)
Gause elimination method
(d)
Gauss - Jordan Method

14. Numerical integration by Simpson's 1/3 rule is:

(a)
Approximation by a parabolic curve
(b)
Approximation by a straight line
(c)
Approximation by a curve of degree three
(d)
Approximation by an elliptic curve
15. The secant methods is:
(a)
Modified form of Regula-Falsi method
(b)
Modified form of Newton-Raphson method
(c)
Modified form of bisection methods
(d)
Modified form of Euler methods
16. Truncation error occurs when:
(a)
Number is rounding-off during the computation
(b)
On replacing infinite process by a finite one
(c)
Error already present in the statement of the problem before its solution
(d)
None of the above
17. Which of the following is not used in the solution of transcendental equation?
(a)
Secant methods
(b)
Newton Raphson method
(c)
Euler method
(d)
Bisection method
18. Which method for the numerical solution of differential equation, is a multi step method?
(a)
Euler's method
(b)
Runge-Kutta Method
(c)
Shooting method

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(d)

109

Predictor-corrector method

19. If the imposed conditions that are required to solve a differential equation of higher order
are given at more than one-point, then the problem is known is:
(a)
Higher value problem
(b)
Multi-Value problem
(c)
Initial value problem
(d)
Boundary value problem
( )
20. In the lagrange's interpolation formula, the sum of lagrangian coefficient is always:
(a)
Unity
(b)
Less than unity
(c)
Greater than unity
(d)
Zero
21. Which interpolation formula cannot have any difference operator?
(a)
Stirling's interpolation formula
(b)
Bessel's interpolation formula
(c)
Newton's genral interpolation formula
(d)
Lagrange's interpolation formula
22. In gausses elimination methods, before applying the back substitute process, the system
of equations reduces to:
(a)
Diagonal matrix
(b)
Lower triangular matrix
(c)
Upper triangular matrix
(d)
Null matrix
23. Which methods for determination of a root of a non-linear equation should never be used
when the graph of f (x) is nearly horizontal in the neighborhood of the root ?
(a)
Bisection methods
(b)
Secant methods
(c)
Methods of false position
(d)
Newton-Raphson method
24. The equation x = x (a)
(b)
(c)
(d)

is a :

Linear equation
Non-linear equation
Transcendental equation
None of the above

For free study notes log on: www.gurukpo.com

110
25. Step by step procedure to solve a problem is knows as:
(a)
Iterative procedure
(b)
Formula
(c)
Technical Procedure
(d)
Algorithm
1. (a)

2. (d)

3. (b)

4. (a)

5. (a)

6. (c)

7. (c)

8. (b)

9. ( c)

10. (c)

11. (c)

12. (b)

13. (c)

14. (a)

15. (a)

16. (b)

17. (c)

18. (d)

19. (d)

20.(a)

21. (d)

22. (c)

23. (d)

24. (b)

25. (a)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

111

BACHELOR OF COMPUTER APPLICATIONS

(Part II) EXAMINATION
(Faculty of Science)
(Three Year Scheme of 10+2+3 Pattern)
PAPER 213

Mathematical Methods for Numerical Analysis and

Optimization
Year - 2011
Time allowed : One Hour
Maximum Marks : 20
The question paper contains 40 multiple choice questions with four choices and students
will have to pick the correct one (each carrying mark).
1.

A large class of techniques is used to provide simultaneous data processing tasks for
the purpose of increasing the computational speed of a computer system is known as:
(a)
Series Processing
(b)
Parallel Processing
(c)
Multiple Processing
(d)
Super Processing
( )

2.

Which number has greatest absolute error, if each number is correct to the given
digits?
(a)
(c)

3.

4.

50.97
5.097

(b)
(d)

509.7
0.5097

The number of significant digits in the number 0.0000205000 is:

(a)
(b)
(c)
(d)
Addition of floating point number 0.5723 E05 and 0.2738E07 is equal to:

For free study notes log on: www.gurukpo.com

( )

( )

112
(a)
(b)
(c)
(d)
5.

6.

7.

8.

9.

0.8461E12
0.5450E05
0.2795E07
None of the above

Successive approximation method is convergent for the equation x =

(a)
| (x)| <1
(b)
(x) < 1
(c)
| (x) |< 1
(d)
(x) > 1

( )
(x) if:

( )

The Iterative formula for Newton-Raphson method is:

(a)

xn+1 = f (xn)

(b)

xn+1 =

(c)

xn+1 =

(d)

xn+1 =

( )

Which iterative method has maximum rate of convergence?

(a)
Secant method
(b)
Bisection method
(c)
Regula-falsi method
(d)
Newton-Raphson method

( )

The equation 2x log 10x = 7 a :

(a)
Transcendental equation
(b)
Algebraic Equation
(c)
Linear equation
(d)
Non-linear equation

( )

Which iterative method requires single initial guess root ?

(a)
Bisection method
(b)
Secant method

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(c)
(d)

Method of false position

Newton Raphson Method

113
( )

10.

If initial guess root of the equation x35x + 3 = 0 is 1, then first approximation for the
root by Newton Raphson method is:
(a)
0.5
(b)
1.5
(c)
1.0
(d)
None of the above
( )

11.

Which method has slow convergence?

(a)
Successive approximation
(b)
Secant
(c)
Newton-Raphson
(d)
Bisection

( )

One root of the equation x3 + 3x2-5x 2 = 0 lies between:

(a)
5 and 4
(b)
4 and 3
(c)
0 and 1
(d)
1 and +1

( )

12.

13.

For the solution of system of linear equations, in which of the following methods the
system of equations reduced to a diagonal system?
(a)
Gauss-Seidual method
(b)
Jacobi method
(c)
Gauss elimination method
(d)
Gauss Jordan elimination method
( )

14.

Which method gives approximate values of the variables?

(a)
Gauss elimination
(b)
Gauss-Jordan
(c)
Jocobi
(d)
None of the above

15.

( )

The first approximate solution by Jacobi method for the system of linear equations:
3x + 5y +10z = 39
15x + 3y +7z = 45
5x + 17y + 8z = 40
(a)
13.0, 15.0, 5.0

For free study notes log on: www.gurukpo.com

114
(b)
(c)
(d)
16.

17.

18.

3.0, 2.3, 3.9

8.0, 15.0 3.9
None of the above

The technique of estimating unknown value at the point within a set of data values is
known as:
(a)
Extrapolation
(b)
Least square method
(c)
Interpolation
(d)
None of the above
( )
2

y0is equal to:

(a)
y2 + y2 y0
(b)
y2 y1 + y0
(c)
y2 + 2y1y0
(d)
y2 2y1 + y0

( )

The values of a function f(x) are given as:

X
f(x)
0
5
1
15
2
25
3
35
4
45
The value of f(x) at x = 1.6 is:
(a)
(b)
(c)
(d)

20.5
21.0
20.0
None of the above

( )

19.

Which interpolation formula is the mean of Gausss forward and backward

formulae?
(a)
Newtons Interpolation formula
(b)
Stirlings Interpolation formula
(c)
Lagranges Interpolation formula
(d)
Bessels Interpolation formula
( )

20.

Which polynomial represents the following tabular values?

x
f(x)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

0
1
4
5
(a)
(b)
(c)
(d)
21.

22.

23.

1
0
45
96

x3 + x2 x + 1
x3 x2 + x 1
x3x2 x + 1
x3x2 + x + 1

( )

The next term of the sequence 1, 0 1, 10, is:

(a)
11
(b)
33
(c)
22
(d)
44

( )

Which interpolation formula cannot have any differences operators?

(a)
Gausss central differences interpolation formula
(b)
Newtons interpolation formula
(c)
Lagranges interpolation formula
(d)
None of the above

( )

The first derivative of f(x) at x = 0 from the following table is:

x
0
1
2
3
4
5
(a)
(b)
(c)
(d)

24.

115

f(x)
4
8
15
7
6
2

26.7
26.7
20.7
20.7

In Simpsons

( )
rule, range of integration is divided into n equal parts, the value of n

is:

For free study notes log on: www.gurukpo.com

116
(a)
(b)
(c)
(d)
25.

divisible by 1
divisible by 2
divisible by 6
divisible by 3

The integral
value obtained is:
(a)

( )
is evaluated by trapezoidal rule by taking h = 1, the error in the

(b)
(c)
(d)
26.

( )

By using Simpson

rule, the value of

dx is equal to : (given that e = 2.72, e2 =

7.39, e3 = 20.09, e4 = 54.6)

(a)
51.87
(b)
53.87
(c)
54.87
(d)
52.87
27.

( )

In gausss three point quadrature formula for weights w0, w1, w2 are as:
a)

, ,

b)

, ,

c)

, ,

d)

, ,

( )

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

28.

29.

30.

Which of the following formula gives more accurate value of the integral?
(a)

Simpsons rule

(b)

Trapezoidal rule

(c)

Simpsons rule

(d)

None of the above

The Eulers formula to solve differential equation

(a)

yn+1 = yn

f (xn, yn)

(b)

yn+1 = yn

(xn, yn)

(c)

yn+1 =

(d)

yn+1 = yn

Given

( )
= f (x,y) with y (x0) = y0 is:

f (xn, yn)
(xn, yn)

( )

= x + y with y(0) =1, numerical solution by Runge-Kutta method of fourth

order at x = 0.1 (taking h = 0.1) is :

(a)
1.110.34
(b)
0.110.34
(c)
1.10340
(d)
1.11340
31.

117

( )

In Runge-Kutta method the value of k is given by:

(a)

(k1+2k2+k3+2k4)

(b)

(k1+k2+k3+k4)

(c)

(k1+2k2+2k3+k4)

(d)

(k1+k2+2k3+2k4)

For free study notes log on: www.gurukpo.com

( )

118
32.

33.

Which method is known as multi-step method?

(a)
Euler
(b)
Picards
(c)
Milnes
(d)
Runge-Kutta
Given
X
0.01
0.02
0.03
0.04
0.05
0.06
The value of
(a)
(c)

34.

35.

36.

37.

( )

y
0.1023
0.1047
0.1071
0.1096
0.1122
0.1148

at x = 0.04 will be equal to:

0.1587
0.2562

(b)
(d)

0.2652
0.1857

(b)
(d)

The operator (1 +
(a)
2
(c)
1

) (1 ) is equivalent to :
(b)
(d)

1
0

( )

Given 3 f(10) is :
(a)
0
(c)
2

(b)
(d)

1
14

( )

Which of the following is correct?

(a)
E 1+
(c)
1E

1+E
1

( )

( )

For the system 10x + y + z = 12, 2x + 10y + z = 13, 2x +2y + 10z = 14, the value of
initial approximation for gauss seidel method are:
(a)
x = 0, y =0, z = 0
(b)
y = 0, z = 0
(c)
x = 1.2, y = 1.3, z = 1.4
(d)
x = 1.2, y =0, z = 0
( )

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

119

38.

During Gauss elimination method the elements aij in the coefficient matrix is known
as pivot elements, when:
(a)
i=j
(b)
i<j
(c)
i>j
(d)
I#j
( )

39.

When we apply Newton Raphson method to find a root of the equation x 32x5 = 0,
the first approximation taking x0 = 2 is as:
(a)
2.0
(b)
2.5
(c)
2.25
(d)
1.75
( )

40.

The square root of the number N can be obtained by the following formula:
(a)

xn+1 = xn +

(b)

xn+1 =

xn +

(c)

xn+1 =

xn

(d)

xn+1 =

xn +

Answer Key
1. ( ) 2. ( )

3. ( )

( )

4.( )

5. ( )

6. ( )

7. ( )

8. ( )

9. ( )

10. ( )

11. ( ) 12.( ) 13. ( ) 14. ( ) 15. ( ) 16. ( ) 17. ( ) 18. ( ) 19. ( ) 20. ( )
21. ( ) 22. ( ) 23. ( ) 24. ( ) 25. ( ) 26. ( ) 27. ( ) 28. ( ) 29. ( ) 30. ( )
31. ( ) 32. ( ) 33. ( ) 34. ( ) 35. ( ) 36. ( ) 37. ( ) 38. ( ) 39. ( ) 40. ( )

___________

For free study notes log on: www.gurukpo.com

120

DESCRIPTIVE PART II
Year 2011
Time allowed : 2 Hours
Maximum Marks : 30
Attempt any four questions out of the six. All questions carry 7 marks each.
1.

(a)
(b)

Use method of iteration to find a real root of the equation: 2x log 10 x = 7

Using bisection method, find the real root of the equation x4+2x3x1 = 0
lying in the interval [0,1]

2.

(a)
(b)

Use Newton-Raphson method to find a root of the equation x32x5 = 0

Use Secant method to find he real root of the equation x32x5 = 0

3.

(a)

Solve the following system of simultaneous linear equations using gauss

elimination method:
Solve the following system of linear equations using gauss-Seidel iterative
method :
27 x + 6y z = 85
6 x + 15 y + 2z = 72
X + y + 54 z = 110

(b)

4.

(a)

(b)

Solve the following system linear equations using matrix factorization

method:
X1+2x2 + 3x3 = 14
2x1 + 5x2 + 2x3 = 18
3x1 + x2 + 5x3 = 20
Estimate the missing term in the following table:
X
0
1
2
3
4

f(x)
1
3
9
?
81

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

5.

(a)

The population of a town in the decennial census was as given below.

Estimate the population for the year 1895:
Year
Population
(in thousands)
1891
1901
1911
1921
1931

(b)

Evaluate

(a)

46
66
81
93
101
by using:

Simpsons one third rule

Simpsons three eight rule.

(i)
(ii)
6.

121

Using Eulers method, find the solution of initial value problem

= xy, y (0)

at x = 0.4, when step-size is 0.1

(b)

Using Runge-kutta method, find an approximate value of y for x = 0.2 in steps of

0.1 it

= x + y2 given y = 1 at x = 0

_________

For free study notes log on: www.gurukpo.com

122

Mathematical Methods for Numerical Analysis and

Optimination
Year 2010
Time allowed : One Hour
Maximum Marks : 20
The question paper contains 40 multiple choice questions with four choices and students
will have to pick the correct one (each carrying mark).
1.

An n-digit floating point number in base

e
(a)
(.d1d2d3...................dn)

(b)
(.d1d2d3...................dn) e
(c)
(d)

2.

(.d1d2d3...................dn)e
(.d1d2d3...................dn)e

of a real number x has the form:

Truncation error occurs when:

(a)
Number is rounding-off during the computation
(b)
On replacing infinite process by a finite one
(c)
Error already present in the statement of the problem before its solution
(d)
None of the above

( )

( )

3.

For the equation f (x) = 2x7 x5 + 4x3 5 = 0 which of the following statement is true
about its roots:
(a)
Two positive and three negative roots
(b)
More than three positive roots
(c)
At least two complex roots
(d)
More than two negative roots
( )

4.

The secant methods is:

(a)
Modified form of Regula-Falsi method
(b)
Modified form of Newton-Raphson method
(c)
Modified form of bisection methods
(d)
Modified form of Euler methods

5.

Which of the following is not used in the solution of transcendental equation?

(a)
Secant methods
(b)
Newton Raphson method

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

(c)
(d)
6.

Euler method
Bisection method

( )

The Newton's iteration formula for the evaluation of

(a)

xn+1 = x0

(b)

xn+1 =

(c)

xn+1 = xn

(d)

xn+1 =

123

is:

xn +

28

xn +

( )

7.

For the solution of system of equations, in which of the following methods the system
of equations reduced to upper triangular system:
(a)
Gauss Jorden Method
(b)
GaussSeidel method
(c)
Jacobi method
(d)
Gauss elimination method
( )

8.

Which of the following is an iteration method for the solution of system of

equations:
(a)
Cramer'sr rule
(b)
GaussJorden method
(c)
Gauss Seidel method
(d)
Crout's method
( )

9.

The Factorial form of the function f (x) = 2x3 2x2 + 3x 10 is :

(a)
x(3) 3x (2) + 2x(1) 10
(b)
2x(3) + 3x(2) + 2x(1) 1
(c)
2x(3) + 3x(2)+2x(1) 10
(d)
2x(3) 3x(2)+2x(1) 10

10.

Which of the following is correct:"

(a)
E 1+
(b)
E1 1

For free study notes log on: www.gurukpo.com

( )

124
(c)
(d)
11.

E1 1
E
log (1+ )

Numerical integration by Simpson's 1/3 rule is:

(a)
Approximation by a parabolic curve
(b)
Approximation by a straight line
(c)
Approximation by a curve of degree three
(d)
Approximation by an elliptic curve

( )

( )

12.

If there are four arguments x0, x0 + h , x0 + 2h, x0 + 3h and corresponding

functions values of f (x) are : f (x0), f (xo+h), f (x0+2h), f (x0+3h) given then for
the integration of f (x) which of the following method applicable:
(a)
Trapezoidal rule
(b)
simpson's 1/3 rule
(c)
Trapezoidal rula and Simpsons's 1/3 rule
(d)
Trapezoidal rule, Simpson's 1/3 rule and Simpson's3 rule
( )

13.

For the equation :

then its approximate solution:
y n+1 + hf (x0 + n 1 h, yn1)
is obtained by:
(a)
Range-Kutta method
(b)
Euler's method
(c)
Modified Euler's method
(d)
Trapezoidal rule

( )

14.

Which of the following statement is incorrect:

(a)
Runge-Kutta method do not required the calculation of higher order
derivatives
(b)
Runge- Kutta method required only the function value at selected points
(c)
Euler's method is second order Runge Kutta method
(d)
Runge-Kutta method of third order agrees with theh Taylor series solution
upto h3
( )

15.

In shooting method, which of the following is correct:

(a)
It depends only on initial conditions
(b)
It depends on the initial choice of two guesses of the slope m
(c)
Its convergence is very high
(d)
Easy to apply on h igher order boundary value problem

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

125

16.

In cubic spline of f(x) which of the following is not correct when data points are :
(x0,y0), (x1,y1),.....................(xn,yn)
(a)
f(x) is a linear polynomial outside the interval (x0, xn)
(b)
f (x) is a cubic polynomial in each of the subintervals
(c)
f (x) is continuous at each point but continuity of f(x) not essential
(d)
f (x) is and f(x) are continuous at each point
( )

17.

In gauss formula for n = 2 the value weight and abscissa are:

(a)
w1 = 0, w2 =1, x1 = 1
, x2 = 1 /
(b)
w1 = 1, w2 = 1, x1= 1 , x2 = 1 /
(c)
w1 = 0, w2 =1 x1 = 1 , x2=2/
(d)
w1 =2, w2 =1, x1 = 1/
x2 =1/

18.

( )

f (x) dx = (y0 + yn) + 4 (y1 + y3 + ..............y n1)

+ 2 (y2 + y4 + ............+ y n2)
(a)
(b)
(c)
(d)

19.

( )

In which of the following method, pivoting is used:

(a)
Euler's method
(b)
Gauss Seidel Method
(c)
Gause elimination method
(d)
Gauss - Jordan Method

20.

( )

ux is equal is:
(a)
(b)
(c)
(d)

21.

Trapezoidal rule
Simpson's 1/3 rule
Simpson's 3/8 rule
Boolean's rule

ux+h + 2ux + uxh

ux+h 2ux + uxh
ux+h + 2ux + ux+h
ux+h 2ux + uxh

The operation
(a)
(c)
+

( )

is equivalent to:
(b)
(d)

For free study notes log on: www.gurukpo.com

( )

126
22.

23.

If f (x) = 1/x then divided difference f(a,b) is:

(a)

(b)

(c)

(d)

25.

26.

27.

( )

Which of the following is true for the divided difference of a function:

(a)
Does not depend on the order of the argument
(b)
Depends on the order of the argument
n
(c)
f (x0, x1,..................xn) =
f (x0)
(d)

24.

ab

f (x0, x1,..................xn) =

f (x0)

( )

Newton-Rephson method is:

(a)

xn+1 = x0

(b)

xn+1 = xn +

(c)

xn+1 = xn

(d)

xn+1 =

( )

Which of the following formula can be applied to evaluate:

with step size 0.4 :
(a)
Trapezoidal rule
(b)
Simpson's 1/3 rule
(c)
Trapeaoidal rule and Simpson's 3/8 rule
(d)
Simpson's 3/8 rule and Simpson's 1/3 rule

( )

The binary equivalent of 0.625 is:

(a)
(0.011)2
(b)
(0.101)2
(c)
(0.100)2
(d)
(0.110)2

( )

The decimal equivalent of (11100111.101)2 is:

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(a)
(b)
(c)
(d)
28.

231.625
37.375
634
14.875

The root of the equation x3 9x+1 = 0 lies between the interval:

(a)
(1,2)
(b)
(2,3)
(c)
(1,)
(d)
(3,4)

127

( )

( )

29.

For the solution of differential equation which of the following methods is not
used:
(a)
Runge- Kutta Method
(b)
Shooting method
(c)
Cubic spline method
(d)
Euler's method
( )

30.

If X is the true value of the quantity and X1 is its approximate value, then:
(a)
(b)
(c)
(d)

31.

32.

33.

define:
Absolute error
Relative error
Percentage error
Rounding error

( )

The equation 2x3+x2+3x+10=0 0 have:

(a)
One real root which is negative
(b)
Only one complex root
(c)
Three complex root
(d)
At the most three positive roots

( )

The first approximate value of the solution of:

= x + y, when y (0) = 1 by Euler method when h = 0.1 is:
(a)
1.2
(b)
1.1
(c)
1.02
(d)
0.01

( )

The approximate value of y of the solution of:

For free study notes log on: www.gurukpo.com

128
= x + y, when y (0) = 1 by Runge-Kutta method when k1 = 0.2000,
k2 = 0.2400, k3 = 0.2440, k4 = 0.2888 is :
(a)
1.2002
(b)
1.2428
(c)
0.2482
(d)
0.2428
34.

( )

If 2.1234 be correct to four decimal point then, the error is:

(a)

103

(b)

105

(c)

104

(d)

103

( )

35.

Which of the following is true?

(a)
In Regula - Falsi method root is approximated by the tangent to the curve
(b)
In Newton-Raphso method root is approximated by a chord
(c)
Newton-Raphson method always converges
(d)
Regula-Faisi method always converges
( )

36.

Which of the following is not true for Newton Raphson method?

(a)
It is applicable to the solution of both algebraic and transcendental equation
(b)
Its convergence is not depend on the initial guess
(c)
It converges is not depend on the initial guess
(d)
None of the above
( )

37.

Which of the following is known as shift operator?

(a)
(b)
E
(c)
(d)

38.

The value of 3 ex is :
(a)
3!ex
(b)
(e1)2 ex
(c)
(e1)3ex

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

(d)

1/3! (e1)3 ex

( )

(a)
(b)
(c)
(d)

f (x) dx = [f (x0)+ f (x4)+{f (x0+h)+f(x0+3h)}+2 f (x2)] is:

Trapezoidal rule
Simpson's 1/3 rule
Simpson's 3/8 rule
Euler formula

( )

39.

40.

129

For the solution of equations

2x+3y+5z = 1, 2x + 3y +z = 5, 3x+4y+z = 7 by factorization method the value of u11,
u12, u13 are:
(a)
1,5,7
(b)
2,2,3
(c)
2,3,5
(d)
1,1,1
( )

Answer Key
1. (d)
2. (b)

3. (c)

4. a)

5. (c)

6. (b)

7. (d)

8. (c)

9. (c)

10. (b)

11. (a)

12. d)

13. (b)

14. (c)

15. (d)

16. (c)

17. (d)

18. (d)

19. (c)

20. (d)

21. (b)

22. (b)

23. (a)

24. (c)

25. (b)

26. (b)

27. (a)

28. (b)

29. (c)

30. (b)

31. (a)

32. (b)

33. (b)

34. (c)

35. (d)

36. (b)

37. (b

38. (c)

39. (b)

40. (c)

___________

For free study notes log on: www.gurukpo.com

130

DESCRIPTIVE PART II
Year 2010
Time allowed : 2 Hours
Maximum Marks : 30
Attempt any four questions out of the six. All questions carry 7 marks each.
Q.1

(a) Write the algorithm to find the value of sin x correct to four decimal placs for a
givne value of x:
(b) Find real root of x34x9 = 0 correct to three decimal place by Regula-falsi
method.

Q.2

(a) Using the starting value x0 = i (i =

) fund a zero of

x4 +x3 + 5x2 + 4x + 4 = 0
(b) Using factorization method solve:
2x1 + 3x2 + x3 = 9
x1 +2x2 + 3x3 = 6
3x1 + x2 + 2x3 = 8
Q.3

(a) Using Gauss elimination method, solve the following system of equations:
x1 + x2 6x3 = 12
3x1x2x3 = 4
x1 + 4x2x3 = 5

Q.4

(a) Using Newton's dividend difference formula defines f(x) as polynomial in x from
the following data:
x

f(x)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

3

39

822

1611

(b) For the following data, find the natural cubic splines and evaluate Y (1.5):

Q.5

11

(a) Using Simpson's 1/3 rule, find

(b) Evaluate :

Using Gauss three point formula.

Q.6

(a)

Find y (0.2) and y (0.4) using Runge Kutta fourth order method, from:

= 1 y2, y (0) = 0
(b)

Using Milne's predictor corrector method find y (0,80 from :

= 1+ y2, y (0) = 0
given that (0.2) = 0.2027, y (0.4)= 0.4228 and y (0.6) = 0.6841

_________

For free study notes log on: www.gurukpo.com

131

132

Mathematical Methods for Numerical Analysis and

Optimization
Year 2009
Time allowed : One Hour
Maximum Marks : 20
The question paper contains 40 multiple choice questions with four choices and students
will have to pick the correct one (each carrying mark).
1.

2.

3.

The equation x2 + 2 sin x = 0 is:

(a)
an algebraic
(c)
an integral equation

(b)
(d)

a transcendental equation
a linear equation

( )

The quation x7+4x3+2x2 + 10x +5 = 0 can be solved by:

(a)
Jacobi method
(b)
Gauss - Seidel method
(c)
Simpson's 1/3 rule
(d)
Secant method

( )

The equation x3 7x2 + 8x + 2 = 0 may have at the most:

(a)
three positive roots
(b)
five positive roots
(c)
two positive roots
(d)
four positive roots

( )

4.

The Newton's Raphson method for the equation f(x) = 0 has initial approximate root
x0 . The method fails, if:
(a)
f '(x0) = 0
(b)
f ''(x0) = 0
(c)
f ' (x0) 0
(d)
f ''(x0) < 1
( )

5.

The newton raphson method in:

(a)
slower than secant method
(b)
slower than secant method
(c)
faster than secant method
(d)
faster than secant method but slower bisection method

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

6.

7.

8.

9.

The equation f (x = 0 can be written as x = (x). If the equation has x0 as an initial

approximation to the root, then the scheme x = (x) will converge to the root of:
(a)

' (x0) > 2

(b)

' (x0) > 1

(c)

(x0) < 1

(d)

' (x0) < 1

( )

An initial value problem = x+ y; y (0) = 5 can be solved by:

(a)
Newton Raphson method
(b)
Gauss-Seidel method
(c)
Simpson's 3/8 rule
(d)
None of the above

( )

The roots of the equation x2 + 4x 8 = 0 lies in the interval:

(a)
[2,3]
(b)
[3,4]
(c)
[4,5]
(d)
[0,2]

( )

The polynomial equation of n degree has:

(a)
(n1) roots
(b)

n2 roots

(c)
(d)
10.

11.

12.

133

roots
n roots

The equation
= x2 + cos y, y(0) = 5; x
(a)
Shooting method
(b)
Jacobi method
(c)
Runge-Kutta method
(d)
Simpson's 1/3 method

( )
[0,1] can be solved by:

The Gauss - Seidel method is applicable only, if:

(a)
The system of equations is non-linear
(b)
The system of linear equation is diagonally dominant
(c)
The system of equations contains three variables
(d)
None of the above
Which one of the following stands for backward difference operator?

For free study notes log on: www.gurukpo.com

( )

( )

134
(a)
(c)

(b)
(d)

(a)
(b)
(c)
(d)

Trapezoidal rule not by the Simpson's 1/3 rule

Both Simpson 1/3 and 3/8
Trapezoidal rule and Simpson's 1/3
Simpson 1/3 rule only

( )

13.

( )

14.

Lagranges's interpolation formula for equidistant points (arguments) reduces into:

(a)
Newton's backword interpolation formula
(b)
Newton's forward interpolation formula
(c)
Central difference interpolation formula
(d)
Newton Raphson formula
( )

15.

Which of the following stands for divided difference?

16.

17.

(a)

f (x0 , x) =

(b)

f (x0 , x) =

(c)

f (x0 , x) =

(d)

f (x0 , x) =

To solve

( )

by gauss quadrature formula, the interval [a,b] is converted to:

(a)

[2,2]

(b)

[2,0]

(c)

[2, 1

(d)

[1,1]

The formula 4 xx+1 = xn

formula is known as:
(a)
Secant method
(c)
Iterative method

( )
determines the roots of the equation f (x) = 0 the
(b)
(d)

Bisection method
Newton raphson method

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

18.
(a)
(c)
19.

20.

21.

y dx = [(y0+y4)+4 (y1 + y3)+ 2y2 ] is:

Trapezoidal rule
(b)
Simpson rule
Gaussian imeration
(d)
Exact integration

135

( )

Pivoting is used in solution is:

(a)
different equation
(b)
integrals
(c)
transcendental equation
(d)
system of linear equations

( )

Runge- kutta method are used for:

(a)
Boundary value problem
(b)
Initial value problems
(c)
Analytical solution
(d)
Numerical integration

( )

A numerical solution may have:

(a)
truncation error
(c)
inherent error

(b)
(d)

propagation error
all of the above errors

( )

22.

If the number 24, 7824621 is represented as 24.782 then the error in this
representation is:
(a)
Propagation error
(b)
Round off error
(c)
Truncation error
(d)
Unbounded
( )

23.

The Euler method for the IVP

(a)
y j+1 = y j1 + hf (xj,yj)

24.

25.

(b)

y j+1 = y j + h2 f (xj, yj)

(c)

y j+1 = y j + hf (xj, yj)

(d)

y j+1 = y j + hf (xj,yj+1)

Runge-kutta method is:

(a)
Single step method
(c)
Analytic method

= f (x,y); y (x0) = y0 is :

( )

(b)
(d)

Multi step method

synthetic method

The scant method for the equation f(x) = 0 is:

For free study notes log on: www.gurukpo.com

( )

136

26.

27.

28.

(a)

xn+1 = xn

(b)

xn1 = xn+1

(c)

xn+1 = xn

(d)

None of the above

x3+7x2 + 3x9 = 0 can be solved by:

(a)
Bisection method
(c)
Secant Method

( )

(b)
(d)

Newton Raphson Method

All of the above method

The number of significant digits in the number 0.0082408 is:

(a)
Seven
(b)
Six
(c)
Five
(d)
Eight

( )

( )

Let X = Exact value; Xc = Computed value, then the absolute error is:
(a)

X Xc

(b)
(c)

29.

30.

(d)

( )

If a = 0.5665 E1; b = 0.5556 E1, then a+b equals :

(a)
0.5720 E1
(b)
0.5072 E1
(c)
0.5722 E1
(d)
1.0022 E1

( )

If a = 0.9432 E 4; b=0.5452 E3 then (ab) equals :

(a)
0.4509 E9
(b)
0.4666 E3
(c)
0.4509 E3
(d)
0.4508 E3

( )

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

31.

32.

The equation
= x2 + y2 ; y (0) = 5; y (2) = 7 is :
(a)
an initial value problem
(b)
a boundary value problem
(c)
Numerical Problem
(d)
Unsolvable problem

137

( )

Let x2 + 7x 3 = 0 be written as
(x)
Let x0 = 0.5 be an initial approximation. The next improved value for the root is:
(a)
0.392
(b)
0.35626
(c)
0.65666
(d)
0.75889
( )

33.

34.

35.

36.

Which of the following is true?

(a)
Bisection method may not converge
(b)
Newton Raphson method has liner convergence
(c)
Bisectioin method has quadratic convergence
(d)
None of the above

( )

Which of the following is true?

(a)
E+1
(b)
1 E + 5
(c)
1+
E
(d)
1
E

( )

Rounding off 4.912575 to five decimals yields:

(a)
4.91257
(b)
4.91125
(c)
4.912576
(d)
4.91258

( )

If the number 5,07932 is approximated to four significant figures, then the absolute
error is:
(a)
5.079
(b)
0.7932
(c)
0.00032
(d)
0.0063
( )

For free study notes log on: www.gurukpo.com

138
37.

The equation f (x) = 0 has toot in [a,b] if:

(a)
f (a) 0, f (b) 0
(b)
f (a) < 0, f (b) < 0
(c)
f (a) > 0 f(b) > 0
(d)
f (a) > 0 f (b) < 0

( )

38.

If x0 = 1 x1 = 2 approximations to a root of the equation x2 +4 sin x = 0 , then the

next approximate value of the root by secant methods is:
(a)
1.577632
(b)
1.60846
(c)
7.76604
(d)
1.86704
( )

39.

If h stands for interval of spacing, then

(a)
f (x+2h) + f(x)
(b)
f (x+ 2h) 2 f (x + h)
(c)
f (x + 2h) +2 (x+h) + f (x)
(d)
f (x+2h) 2 f (x+h) + f (x)

40.

f (x) equals:

( )

Fourth order Runge Kutta methods uses:

(a)
Two Slopes
(b)
Three slopes
(c)
Four slopes
(d)
Five slopes

( )

Answer Key
1. (d)
2. (b)

3. (c)

4. (a)

5. (c)

6. (b)

7. (d)

8. (c)

9. (c)

10. (b)

11. (a)

12. d)

13. (b)

14. (c)

15. (d)

16. (c)

17. (d)

18. (d)

19. (c)

20. (d)

21. (b)

22. (b)

23. (a)

24. (c)

25. (b)

26. (b)

27. (a)

28. (b)

29. (c)

30. (b)

31. (a)

32. (b)

33. (b)

34. (c)

35. (d)

36. (b)

37. (b)

38. (c)

39. (b)

40. (c)

___________

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

139

DESCRIPTIVE PART II
Year 2009
Time allowed : 2 Hours
Maximum Marks : 30
Attempt any four questions out of the six. All questions carry 7 marks each.
Q.1

(a)

Compute

with x = 0.4845 and y = 0 4800, using normalized floating point arithmetic.

compare with value (xy). Determine the relative error of the former.
(b)

Find the value (1+x2)when

x=0.5999 E 2

Q.2

(a)

Find the root of the equation.

x3 5x2 17x + 20 = 0
in the interval [0,1] by secant method.

(b)

Use newton Raphson method to find root of the equation 1 + x3 = sin x in the
interval [1, 2]

Q.3

(a)

Solve the system of equations using Gauss elimination method

5x12x2 + x3 = 4
7x1 + x2 5x3 = 8
3x1 + 7x2 + 4x3 = 10

(b)

Solve the system of equation using Gauss - Seidel method:

2x1 x2 + x3 + 5
x1+2x2 + 3x3 = 10
x1 +3x2 2x2 = 7

For free study notes log on: www.gurukpo.com

140
Q.4

(a)

(b)

Compute f (4), using lagrange's interpolation formula:

x

f(x)

1.5

0.25

20

Using the following information, find f (x) as a polynomial in powers of (x

6):

Q.5

Q.6

f(x)

11

141

10

561

(a)

Compute the following integral by Simpson's rule using 11 ordinates:

(b)

Use gauss three point quadrature rule to compute the integral.

(a)

Using Fourth order Runge-Kutta method with one step. compute (0.1) to five
places of decimal, if
= 0.3 t2 + 0.25 y + 0.31
and y = 0.72 when t = 0

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(b)

Evaluate y (0.4) by Milne's predictor corrector method where y satisfies

differential equation.
= 2e3 y
and the corresponding values of t and y are given as:
t
y
0
2
0.1
2.01
0.2
0.204
0.3
2.09

________

For free study notes log on: www.gurukpo.com

141

142

Mathematical Methods for Numerical Analysis and

Optimization
Year 2008
Time allowed : One Hour
Maximum Marks : 20
The question paper contains 40 multiple choice questions with four choices and students
will have to pick the correct one (each carrying mark).
1.

Let the true value of a quantity be . If we approximate it by the decimal fraction 0.33
then the relative error is equal to:
(a)
102
(b)
103
x 103

( )

The number of significant digits in the number 0.0001043 is:

(a)
Eight
(b)
Seven
(c)
Four
(d)
Three

( )

(c)
2.

x 102

(d)

3.

If a positive decimal number be represented in a normalized floating point mode, then

the true statement is:
(a)
0 mantissa < 1
(b)
0.1 mantissa < 1
(c)
0.1 mantissa < 0
(d)
0.< mantissa 0.1
( )

4.

If we add the floating point number 0.4123 E 02 and 0.1547 E 01. Using 4 digit
word length, then the result is equal to:
(a)
0.5670 E01
(b)
0.4124 E 02
(c)
0.4138 E 1
(d)
0.4138 E 01
( )

5.

The logical and concise list of procedure for solving a problem is known as:
(a)
Iterative procedure
(b)
Approximation method
(c)
Series procedure
(d)
Algorithm

6.

( )

If x = 0.555 E01, y= 0.4545 E01 and z=0.4535 E01. Then the value of x (yz) is
equal to:
(a)
0.5000 E 01

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(b)
(c)
(d)
7.

The equation x =
(a)
(b)
(c)
(d)

8.

0.555 E 01
0.5454 E 01
0.5555 E01

143

( )
is a :

Linear equation
Non-Linear equation
Transcendental
System of equation

( )

An iterative formula for a bisection methods is:

(a)
(b)

(c)

(d)

( )

9.

If 2.5 is the initial root of the equation x3x10 = 0, then by the method of Newton
Raphson, the next approximate root will be equal to:
(a)
2.3089
(b)
2.55395
(c)
2.6760
(d)
2.6657
( )

10.

If x0 =2.0 and x1 = 3.0 are the two initial roots of the equation x35x3 = 0 then by
secant method, the next approximate root x2 will be equal to:
(a)
2.2756
(b)

2.3023

(c)

2.3571

(d)

2.4005

For free study notes log on: www.gurukpo.com

( )

144
11.

An iterative formula for the method of successive approximation for the equation f
(x) = 0 is given by:
(a)
(b)
(c)
(d)

( )

12.

Which method for determine of root of non linear equation always have guaranteed to
converge the required root:
(a)
Bisection method
(b)
Secant method
(c)
Newton Raphson method
(d)
Method of successive approximations
( )

13.

For the solution of the system of equations, in gauss elimination method, before
applying the back substitution process, the given system of equation reduces to:
(a)
singular matrix
(b)
Diagonal matrix
(c)
Lower triangular matrix
(d)
Upper triangular matrix
( )

14.

The solution of the system of equations by Gauses elimination method is:

2x + 4y + 2z = 15
2x+ y + 2z = 5
4x+y2z = 0
(a)

3, 6

(b)

(c)

4, 5,

(d)

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

15.

First approximate solutions by Gauss-Seidel iteration method for the system of

equation:
6x+3y+z =9;
2x5y+2z = 5;
3x+2y+8z= 4
with initial approximation x = 1.0, y = 1,0,Z = 1.5 is:
(a)
1.5, 1.0, 0.5
(b)
1.167, 1.0, 1.125
(c)
1.167, 1.067, 1.204
(d)
1.067, 1.125, 1.204

16.

17.

145

( )

For the system of equations:

a11x1+a12x2 = a13 and a21x1 + a22 x2 = a23
the gauss seidel iteration method converges it:
(a)

>1

(b)

<1

(c)

>1

(d)

<1

( )

For the solution of system of the equations:

2x+3y+z = 9
x + 2y + 3z = 6
3x+y+2z = 8
by matrix factorization method by factorized the square matrix a into the form LU,
where is the unit lower triangular and U is the upper triangular matrices, then the
matrix U is equal to:
(a)

1
0
0

3
1
0

1
5/2
1

(b)

1
0
0

7
1
0

3/2
1/2
1

For free study notes log on: www.gurukpo.com

146

(c)

2
0
0

3
1/2
0

1
5/2
18

(d)

2
0
0

7
1/2
0

3/2
1/2
9

( )

18.

Which method is a successive approximation method, which starts from an

approximation to the true solution and, if convergent, the cycles of computations
being repeated till the required accuracy is obtained:
(a)
Matrix inversion method
(b)
Matrix factorization method
(c)
Gauss -= elimination method
(d)
Guass-Seidel method
( )

19.

A set of tabulated valued of x and f (x) for the function y = f (x) are given as:
x
f (x)
30
0.5000
35
0.5736
40
0.6428
45
0.7071
then the value of
(a)
0.0004
(b)
0.0005
(c)
0.0006
(d)
0.0044

20.

3 y1

(a)
(b)
(c)
(d)
21.

f (x) is equal to:

is equal to:
y3 3y2+3y1y0
y43y3 + 3y2y1
y3+3y23y1+y0
y4+3y33y2+y1

Newton's forward difference interpolation formula is useful at:

(a)
Interpolation near the beginning of a set of tabular values
(b)
Interpolation near the end of a set of tabular values

For free study notes log on: www.gurukpo.com

( )

( )

Mathematical Methods for Numerical Analysis and Optimization

147

(c)
(d)

Interpolation near the middle values of a set of tabular values

Interpolation for unequal arguments at any point

22.

Which
(4,24),
(a)
(b)
(c)
(d)

polynomial represents the following set of value (0,0), (1,3), (2,8), (3,15),
(5,35):
x5 + x4 + x3 + x2 x
x4 + 2x3 + x2 x
2x3 x2 + 2x
x2 + 2x
( )

23.

The second divided different of the function f(x) =

by:
(a)

( )

for the arguments a,b,c is given

(b)
(c)
(d)
24.

( )

Given the following table:

x
1.0
1.0
1.3

f(x)
0
0.09531
0.26236

The value of f (x) at x = 1.2 will be equal to:

(a)
0.17268
(b)
(c)
0.18276
(d)

0.16827
0.19346

( )

25.

If arguments are not necessarily be equidistant, then which interpolation formula used
to interpolate at any intermediate value of x:
(a)
Newton's forward interpolation formula
( b)
Newton's backward interpolation formula
(c)
Newton's general interpolation formula
(d)
Sterling's interpolation formula
( )

26.

The piecewise polynomial:

For free study notes log on: www.gurukpo.com

148
x+1, 1 x 0
2x+1, 0 x 1
4x, 1 x 2

f (x) =

(a)
(c)
27.

Linear spline
Third degree spline

Second degree spline

Not a spline

( )

The value of the first derivate of f (x) at x = 0.4 from the following table:
x
0.1
0.2
0.3
0.4
is given by:
(a)
1.49182
(b)
1.4913
(c)
1.34986
(d)
1.34762

28.

(b)
(d)

f (x)
1.10517
1.22140
1.34986
1.49182

( )

( )

Which interpolation formula does not have any difference operator:

(a)
Newton's general interpolation formula
(b)
Bessel's interpolation formula
(c)
Stirling's interpolation formula
(d)
Lagrange's interpolation formula

( )

29.

During the gauss elimination procedure the pivot element (amk) should be searched
and the equation with the maximum value of (amk ) for m = k +1, n should be
interchanged with the current equation. This procedure is called:
(a)
Maxima Pivoting
(b)
Partial Pivoting
(c)
Total pivoting
(d)
None of these
( )

30.

Which numerical integration formula is the trapezoidal rule:

(a)

=h

+ 2 (y1+ y2 + y3 + ........ + yn1)

(b)

=h

+ (y1 + y2 + y3 + ........ + yn1)

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

31.

(c)

+ (y1+ y2 + y3 + ........ + yn1)

(d)

+ 2 (y1 + y2 + y3 + ........ + yn1)

Using Simpson's 1/3 rule for numerical integration, the value of

taking h = 0.25 will be equal to:
(a)
0.6945
(b)
0.6970
(c)
0.6927
(d)
0.6932

32.

The value of

( )
by

( )

dx, where f (x) is given by the following table, using

Simpson's rule is:

x
0.6
0.5
0.4
0.3
0.2
0.1
0
0.1
0.2
0.3
(a)
2.475
(b)
2.457
(c)
2.547
(d)
2.745
33.

149

If we transform the integral

then f (u) is given by:
(a)
u+1

f (x)
4
2
5
3
2
1
6
4
2
8

( )
into

du by gauss quadrature formula,

(b)
(c)

For free study notes log on: www.gurukpo.com

150
(d)

( )

34.

If all the imposed conditions that are required to solve a differential we equation are
prescribed at one point only, then the differential equation together with the
conditions is known as:
(a)
Initial value problem
(b)
Boundary value problem
(c)
Multi value problem
(d)
Higher value problem
( )

35.

Which formula is knwon as Euler's method for solution of a differential equation of

first order:
(a)
yi+1 = yi + xi f (xi,yi)
(c)
yi+1 = yi xi f (xi,yi)
(a)
yi+1 = yi h f (xi,yi)
(c)
yi+1= yi f (xi,yi)
( )

36.

Given
= 1 y with the initial condition x = 0, Y = 0 then by Euler's method (h =
0.1) the value of y approximately for x = 0.1 is:
(a)
0
(b)
0.1
(c)
0.05
(d)
0.05
( )

37.

If the solution of a differential equation

= f (x, y) with y (x0) = y0 is given by

Runge- Kutta fourth order method as y (x0 + h) = y0 + (k1+2k2+2k3+k4), where k1,

k2, k3, k4 are Runge kutta coefficients, then the value of k4 is given by :
(a)

k4 = hf

(b)

k4 = hf

(c)

k4 = hf

(d)

k4 = f

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

151

38.

The numerical solution at x = 0.1 of the differential equation

= x+ y with initial
condition y (0) = 1 by Runge Kutta Method of fourth order (h = 0.1) is :
(a)
1.11.34
(b)
1.058675
(c)
0.12105
(d)
1.12105
( )

39.

Which method for numerical solution of a differential equation is knwon as 'multistep method:
(a)
Euler's method
(b)
Predictor-=corrector method
(c)
Runge-Kutta method
(d)
None of these
( )

40.

'Shooting method' is a method to solve:

(a)
An algebraic equation
(b)
A transcedental equation
(c)
A differential equation
(d)
Both algebraic and transcendental equations

( )

Answer Key
1. (a)
2. (c)

3. (a)

4. (b)

5. (a)

6. (b)

7. (b)

8. (d)

9. (c)

10. (c)

11. (d)

12. (d)

13. (d)

14. (b)

15. (c)

16. (c)

17. (c)

18. (d)

19. (b)

20. (b)

21. (a)

22. (d)

23. (a)

24. (c)

25. (d)

26. (a)

27. (b)

28. (d)

29. (c)

30. (a)

31. (d)

32. (a)

33. (b)

34. (a)

35. (c)

36. (b)

37. (c)

38. (b)

39. (c)

40. (c)

_____________

For free study notes log on: www.gurukpo.com

152

DESCRIPTIVE PART II
Year 2008
Time allowed : 2 Hours
Maximum Marks : 30
Attempt any four questions out of the six. All questions carry 7 marks each.
Q.1

Perform the following arithmetic operations by assuming the mantissa is

truncated to six digits. Write the answer in normalized floating point form:
(i)

Add the number 0.586351 E05 and 0.9664572 Eo2

(ii)

Subtract the number 0.725374 E02 from 0.546332 E03

(iii)

Multiply the number 0.654321 E06 and 0.225579 E03

(iv)

Divide the number 0.876543 E=05 by 0.246875 E-02

(v)

Find the relative error if the number 37.46235 is approximated to four

significant figures.

Q.2

(a)

Find the root of the equation x3 5x + 1 = 0 by disection method, correct up

to five decimal places between 0.2016 and 0.2017.

(b)

Find the real foot of the equation x33x 5 = 0 correct up to four places of
decimals by newton Raphson method.

Q.3

(a)

Use the secant method to obtain a root of the equation x3 - 5x - 3 = 0 correct

to four decimal places.

(b)

Find a root near to zero of the equation x3 - 4x + 1 = 0 by the method of

successive approximation correct up to three decimal places.

Q.4

(a)

Solve the following system of equation using Gauss elimination method:

x + 3y +z =3
2x + 3y - 4z =9

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

153

x + 5y - 2z = 8

(b)

Solve the following system of equations using Gauss-Seidel method correct

up to three decimal places:
10x+y+2z = 44
2x+10y+z=51
x+2y+10z = 61

or
Solve the following system of equation by matrix factorization method;
5x 2y + z = 4
7x +y 5z = 8
3x+7y+4y =10
(b)

Matrix factorization method

we have equations
5x - 2y + z = 4
7x + y - 5y
3x+7y + 4y =10

Q.5

(a)

Give that;
f(1) = 2, f(2) = 4, f(3) = 8, f(4) = 16, f(7)=128
Find the value of f (5) with help of Lagrange's interpolation formula.

(b)

Evaluate the following integral by using gauss - three point quadrature rule;

For free study notes log on: www.gurukpo.com

154
Q.6

(a)

Using Euler's method with step size 0.1, find the value of y (0.5) from the
following differential equation;
= x2 + y2, y (0) = 0

(b)

Using Range Kutta method of fourth brder, find an approximate value of y

for x = 0.2 in steps of 0.1, if;

= x + y2

with y (0) = 1

_________

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

155

Mathematical Methods for Numerical Analysis and

Optimization
Year 2007
Time allowed : One Hour
Maximum Marks : 20
The question paper contains 40 multiple choice questions with four choices and students
will have to pick the correct one (each carrying mark).
1.

2.

3.

4.

The number of significant digits in the number 0.0003090 is :

(a)
Two
(b)
Three
(c)
Four
(d)
Seven

( )

If the number 382.00597 106 be written in normalized floating point form.

Then the exponent part will be :
(a) 106
(b) 109
(c) 103
(d) 108

( )

If X is the true value of a quantity and X' is its approximate value, then relative error
is given by:
(a)
x-x
(b)

x-x'
x

(c)

x
x-x'

(d)

x
x'-x

( )

If 0.333 is the approximate value of then the percentage error is equal to:
(a)
0.0%
(b)
100.0%

For free study notes log on: www.gurukpo.com

156
(c)
(d)
5.

0.011%
0.099%

( )

Addition of the floating point numbers 0.4546 E05 and 0.5434 E07 is equal to:
(a)
0.9980E05
(b)
0.9980 E07
(c)
0.998 E12
(d)
0.5479E07

( )

6.

If x = 0.5665 E01, y= 0.5556 E01, and z=0 0.5644 E01, then the value of (x+y) zis
equal is:
(a)
0.7600 E01
(b)
0.7656 E01
(c)
0.5577 E01
(d)
0.5577 E01
( )

7.

A large class of techniques that are used to provide simultaneous does processing
tasks for the purpose of increasing the computational speed of a computer system is
known is:
(a)
Super Processing
(b)
Series Processing
(c)
Multiple Processing
(d)
Parallel Processing
( )

8.

The equation x
is a :
(a)
Linear equation
(c)
Transcendental

(b)
(d)

Non-Linear Equation
Non-algebraic equation

( )

9.

If 0.0, 1.0, 2.0, 3.0 are the initial guess roots of the equation x3x1=0, then by
Bisection method, the next root will be equal to:
(a)
0.5
(b)
1.5
(c)
2.5
(d)
2.75
( )

10.

If x= 2.3 is the initial root of the equation x32x + 5 = 0, then by the method of
Newton-Raphson, the next approximate root will be equal to:
(a)
2.1149

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(b)
(c)
(d)
11.

2.2118
2.0957
2.2118

157

( )

An iterative formula for a secant method is:

(a)

Xn+1 = Xn

(b)

Xn+1 = Xn

(c)

Xn+1 = Xn +

(d)

Xn+1 = Xn

( )

12.

If X0 = 1.0 and X1 = 2.0 are the two initial roots of the equation x35x + 3 = 0, then by
secant method, the next root x2 will be equal to:
(a)
0.5
(b)
1.5
(c)
0.0
(d)
4.0
( )

13.

Which method having slow sure convergence?

(a)
Newton-Raphson Method
(b)
Secant Method
(c)
Bisection Method
(d)
Method of successive approximation

14.

( )

During Gauss elimination method, the element, aij in the coefficient matrix is known
as pivot element, when:
(a)
i> j
(b)
i<j
(c)
i= j
(d)
i
( )

For free study notes log on: www.gurukpo.com

158
15.

A method for solution of system of linear equations in which first the system of
equation reduce to an equivalent upper triangular system and then solved it by back
substitution. This method is known as:
(a)
Matrix seidel method
(b)
Gauss - Jordan method
(c)
Gauss - Seidel method
(d)
Gauss elimination method
( )

16.

First approximate solution by Gauss-Seidal method for the system of equatm 2, 1

(b)
kbps
( )

17.

For the solution of the system of equations:

3x + 5y + 2z = 8; 8y + 2z = 7 ; 6x + 2y + 8z = 26
by matrix factorization method factorize the square matrix A into unit lower
triangular and upper triangular matrices L and U, then matrix L is equal is:
(a)
1
0
0

(b)

(c)

(d)

For free study notes log on: www.gurukpo.com

( )

Mathematical Methods for Numerical Analysis and Optimization

159

18.

Given the set of tabular values (x0, y0), (x1, y1), (x2, yn) satisfying the relation y = f (x)
where the explicit natur eo f(x) is not known, it is required to find a simpler function
(x) agree at the set of tabulated points, such a process is called;
(a)
Iteration
(b)
Interpolation
(c)
Polynomialization
(d)
Factorization
( )

19.

A set tabulated values of X and f (x) for the function y = f (x) are given as :

then the value of

(a)
0.19
(c)
0.41
20.

1.4

1.8

2.2

f (x)

3.49

4.82

5.96

6.5

(b)
(d)

0.60
1.33

f(x) is equal is:

Newton's backward difference interpolation formula is useful at interpolation:

(a)
Near the beginning of a set of tabular values
(b)
Near the end of a set of tabular values
(c)
Near the middle values of a set of tabular values
(d)
For unequal arguments at my point

( )

( )

21.

The third divided difference with the arguments a,b,c,d of the function f (x) 1/x is :
(a)
abcd
(b)
abcd
(c)
(d)
( )

22.

When interpolation formula is merely a relation between two variables x and f(x)
either of which may be taken as the independent variable:
(a)
Newton's forward interpolation formula
(b)
Newton dividend interpolation formula
(c)
Lagrange's interpolation formula
(d)
Stirling's interpolation formula
( )

23.

Estimate f (1) from the following set of values of x and f (x) as:
x
f (x)

0
1

2
1

4
33

6
145

For free study notes log on: www.gurukpo.com

160
(a)
(b)
(c)
(d)
24.

0
1
3
11

( )

Which polynomial represent the following tabular values:

x
f (x)
(a)
(b)
(c)
(d)

0
2

1
3

2
12

5
147

x3 x2 + x + 2
x3 + x2 x+2
x3 + x2+x+2
x3 + 2x2 2x +2

( )

25.

Which interpolation formula is the mean by Gauss's forward the backward formula?
(a)
Newton's general interpolation formula
(b)
Stirling's interpolation formula
(c)
Lagrange's interpolation formula
(d)
Bessel's interpolation formula
( )

26.

Given:
x
y

0
4

1
8

then the value of

(a)
13.5
(b)
27.5
(c)
0
(d)
57.6667
27.

The value of

2
15

3
7

4
6

at x = 0 will be equal to:

( )
f (x) = 0.04 from the following table using Bessel's formula is:

x
0.01
0.02
0.03
0.04
0.05
0.06
f(x) 0.1023 0.1047 0.1071 0.1096 0.1122 0.1148
(a)

0.2562

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(b)
(c)
(d)
28.

0.2652
0.15.87
0.1857

161

( )

Which numerical integration formula is the Simpson's rule?

(a)

= {(y0+yn) + 2 (y1+y2+y3+.............+yn1)}

(b)

= {(y0+yn) + 3 (y1 +y3 +y5 +.............+yn1)

+6(y2+y4+y6+...........+yn-2)}

(c)

= {(y0+yn) + 2 (y1+y3+y5+.............+yn1)}
+ 4 (y2+y4+y6+...........+yn-2)}

(d)

= {(y0+yn)+ 4 (y1+y3+y5+.............+yn1)}
+2(y2+y4+y6+...........+yn-2)}

29.

30.

( )

Using Trapezoidal Rule with five sub-intervals the value of

(a)
0.33
(b)
0.25
(c)
0.26
(d)
0.24
By using Simpson's rule, the value of

ex equal to :

( )

ex dx equal to (given that e=2.72, e2

= 7.39, e3 20.09 and e4 = 54.6):

(a)
51.87
(b)
52.87
(c)
53.87
(d)
54.87

For free study notes log on: www.gurukpo.com

( )

162
31.

32.

33.

If the integral
be transform by Gaussian integration as
relation between x and u is given by:
(a)

u=

x + (a+b)

(b)

u=

x + (a+b)

(c)

x=

u+ (a+b)

(d)

x=

u + (a+b)

Using Gaussian two point quadrature formula, the value of

(a)
29.6667
(b)
30.6667
(c)
32.6667
(d)
31.7767

du, then the

( )
(x2+2x) dx is :

Which of the following numerical integration formula is the best formula?

(a)
Trapezoidal rule
(b)
Simpson's one-third rule
(c)
Simpson's three-eight rule
(d)
None of the above

( )

( )

34.

Which of the numerical integration formula does not require equally spaced values of
X at which given functional values were used?
(a)
Trapezoidal rule
(b)
Simpson's one - third rule
(c)
Simpson's three - rule
(d)
Gauss's quadrature formula
( )

35.

Given
for x
(a)
(b)
(c)
(d)

= x + y, with y (0), then by Euler's method, the value of y approximately

=0.4 (h =0.2) is :
0.04
0.104
0.128
0.2736
( )

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

36.

37.

163

If the solution of a differential equation (initial value)

=f (x,y) with y (x0) = y0 is
given by Runge-Kutta fourth order method as y (x0+h) = y0 + k, where k1, k2, k3, k4
are Runge Kutta coefficients, then the value of k is given by:
(a)

k=

(k1 + k2 + k3 + k4)

(b)

k=

(k1 + 2k2 + k3 + k4)

(c)

k=

(k1 + 2k2 + 2k3 + k4)

(d)

k=

(k1 + 2k2 + 2k3 + 2k4)

Given

( )

with y (0) = 1, then the numerical solution by Runge- Kutta method

of fourth order at x = 0.2 (take h = 0.2) is:

(a)
1.1414
(b)
1.16678
(c)
1.1837
(d)
1.6662

( )

38.

A method for the numerical solution of a differential equation that in each step uses
values from more than one of the preceding steps, is known is:
(a)
Single-step method
(b)
Multi-step method
(c)
Boundary-step method
(d)
Higher-step method
( )

39.

Given that
x
y

= 1 + xy2, y (0) = 1 with

0.1
0.2
0.3
1.105 1.223 1.355

then the solution of the differential equation at x= 0.4 Milne's predictor corrector
method is equal to:
(a)
(b)
(c)

0.5396
1.53380
1.94481
For free study notes log on: www.gurukpo.com

164
(d)
40.

1.94462

( )

Which method is used for obtaining the numerical soluation of a boundary value
problem:
(a)
Euler's method
(b)
Runge-Kutta method
(c)
Mile's method
(d)
Shooting method
( )

Answer Key
1. (b)
2. (b)

3. (b)

4. (d)

5. (d)

6. (b)

7. (d)

8. (a)

9. (b)

10. (a)

11. (d)

12. (b)

13. (b)

14. (c)

15. (d)

16. (d)

17. (a)

18. (b)

19. (c)

20. (b)

21. (d)

22. (c)

23. (a)

24. (b)

25. (b)

26. (a)

27. (a)

28. (d)

29. (a)

30. (c)

31. (c)

32. (b)

33. (c)

34. (d)

35. (a)

36. (c)

37. (b)

38. (b)

39. (b)

40. (b)

_______

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

165

DESCRIPTIVE PART II
Year 2007
Time allowed : 2 Hours
Maximum Marks : 30
Attempt any four questions out of the six. All questions carry 7 marks each.
Q.1

(a)

If the normalization on floating points is carried out at each stage, prove the
following:

(i)

(b)

a (bc)

abac

(ii)

(a+b) c

(ac) + b

a = 0.5555 E01

a = 0.5665 E01

b= 0.4545 E01 and

b = 0.5556 E01 and

c = 0.4535 Eo1

c = 0.5644 E01

Define absolute, relative and percentage, errors in computer arithmetic. Round

off then number 75462 to four significant digits, then calculate the absolute
error and percentage errors.

Q.2

(a)

Find a real root of the equation x34x 9 = 0 using Bisection method correct
to three decimal places.

(b)

Using Newton Raphson method, find a real of the equation

x log10 x = 1.2
Correct to five decimal places.

Q.3

(a)

A real root of the equation x3 5x +1 = 0 lies in the interval (0,1) perform

four iterations of the secant method.

(b)

Find a real root of the equation x3 + x21 = 0 by using the methods of

successive approximation correct to four decimal places.

Q.4

(a)

Solve the following system of equation using Gauss - elimination method:

For free study notes log on: www.gurukpo.com

166
2x+y+4z = 12
8x3y + 2z =20
4x + 11y z = 33
(b)

Solve the following system of equation using the Gauss seidel iteration
method correct up to two decimal places.
or
Solve the following system of equations by matrix factorization method:
3x + 5y+2z = 8
8y+2z = 7
6x+2y+8z = 26

Q.5

(a)

Using Newton's Divided Difference Formula, find f (8) given f(1) = 3, f (3) =
31, f (6)= 2223, f(6)= 223, f (10) = 1011, f (11) = 1343

(b)

Q.6

(a)

Find the first and second derivative of f(x) at x = 0 from the following table:
x

f(x)

15

Using Runge-Kutta method of fourth-order solve

for x = 1.4 Initially x= 1, y =2 take h = 0.2

(b)

Solve the boundary value problem

y" (x) = y (x); y (0)= 0, y(1) = 1.1752
by the shooting method, taking m0 = 0.7 and m1= 0.8

_______

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

167

Mathematical Methods for Numerical Analysis and

Optimization
Year 2006
Time allowed : One Hour
Maximum Marks : 20
The question paper contains 40 multiple choice questions with four choices and students
will have to pick the correct one (each carrying mark).
1.

The number is significant digit is the number 0.00018045 is:

(a)
Four
(b)
Five
(c)
Six
(d)
Eight

( )

2.

If a positive decimal number be represented in a normalized floating point mode, then

the true statement is:
(a)
1 mantissa 0
(b)
0 mantissa < 1
(c)
0.1 mantissa < 1
(d)
0 < mantissa 0.1
( )

3.

Normalized floating point form of the number 0.0004382 x 102 is given by:
(a)
0.4382E 01
(b)
0.4382 E 02
(c)
0.4382E + 02
(d)
4.3820 E 01

( )

4.

Addition of the floating point number 0.4123 E02 and 0.1547 E - 01, using 4 digit
word lengths is:
(a)
0.5670 E02
(b)
0.5670 E01
(c)
0.4124 E02
(d)
0.4124 E01
( )

5.

Subtraction of 0.9432 E-04 from 0.5452 E- 03 is normalized form is:

(a)
0.4509 E - 03

For free study notes log on: www.gurukpo.com

168
(b)
(c)
(d)
6.

0.4550904
0.3980 E 03
0.3980 E04

( )

Step by step procedure to solve a problem is knows as:

(a)
Iterative procedure
(b)
Formula
(c)
Technical Procedure
(d)
Algorithm

( )

7.

The representation of a finite sequence of simple instructions for solving a problem in

a programming language is known is:
(a)
Flow chart
(b)
Program
(c)
Algorithm
(d)
Iterative language
( )

8.

Errors due to finite representation of an inherently infinite process is knows is:

(a)
Rounding errors
(b)
Truncation errors
(c)
Input errors
(d)
Relative errors

( )

Round due to finite representation of an inherently infinite process is knows is?

(a)
0.0900
(b)
0.09003
(c)
0.09004
(d)
0.1000

( )

9.

10.

An approximate value of
is given by 22/7 = 3.1428571 and its true value is
3.1415926, Then the relative error is:
(a)
0.0012645
(b)
0.00012645
(c)
0.00402
(d)
0.1000
( )

11.

The equation x = x
(a)
(b)

is a :

Linear equation
Non-linear equation

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(c)
(d)

Transcendental equation
None of the above

169
( )

12.

If (x) is continuous in a closed interval a x b and f (a) and f (a), f (b) < 0, then it
follows that:
(a)
At least one real root of f(x) = 0 lies in the interval a < x < b
(b)
No any real root of f(x) = 0 lies in the interval a < x< b
(c)
At least one real root of f (x) = 0 lies outside at right of the interval a x b
(d)
At least one real root of f (x) = 0 lies outside at left of the interval a x b ( )

13.

If 0, 0.5 and 1.0 are the initial guess roots of the equation x 3 5x +1 = 0 then by
Bisection method, the next improved root will be equal to:
(a)
0.25
(b)
0.75
(c)
1.25
(d)
0.85
( )

14.

If X0 = 2.0 is the initial root of the equation x4x10 = 0 then by the method of
Newton - Raphson the next approximate root will be equal to:
(a)
1.781
(b)
1.978
(c)
1.871
(d)
1.789
( )

15.

The methods for determination of a root of a non-linear equation which uses two
initial guess roots does not require that they must bracket the root is:
(a)
Bisection methods
(b)
Methods of false position
(c)
Secant method
(d)
Newton-Raphson method
( )

16.

If x1=
secant
(a)
(b)
(c)
(d)

17.

Which iterative methods requires two real roots?

(a)
Bisection method
(b)
Secant method
(c)
Method of false position

3.0 and x2= 0.0 are the two initial roots of the equation x2+x2 = 0 they by
methods, the next root x3 will be equal to:
1.0
2.5
3.5
1.5
( )

For free study notes log on: www.gurukpo.com

170
(d)

Method of successive approximations

( )

18.

Which methods for determination of a root of a non-linear equation should never be

used when the graph of f (x) is nearly horizontal in the neighborhood of the root ?
(a)
Bisection methods
(b)
Secant methods
(c)
Methods of false position
(d)
Newton-Raphson method
( )

19.

The solution of a system of linear equations obtained by direct methods such as gauss
elimination or matrix factorization methods, it contains:
(a)
Reflection errors
(b)
Round-off errors
(c)
Data entry errors
(d)
Conversation errors
( )

20.

In gausses elimination methods, before applying the back substitute process, the
system of equations reduces to:
(a)
Diagonal matrix
(b)
Lower triangular matrix
(c)
Upper triangular matrix
(d)
Null matrix
( )

21.

For the solution of the system of equations, for pivotal condensation may be used
along with the methods:
(a)
Gauss - seidal iteration methods
(b)
Gauss - Elimination methods
(c)
Matrix factorization methods
(d)
Matrix inverse methods
( )

22.

First approximate solutions by Gauss - Seidel methods for the system of equations:
2x + y+z = 5; 3x + 5y+ 2z = 15; 2x + y + 4z = 8 is:
(a)
0,1.5,.5
(b)
1.5, 1.5, 0.4
(c)
2.5, 1.5, 0.4
(d)
5.0, 3.0, 1.5
( )

23.

In the matrix factorization methods, the matrix A, factorized into L and U, then the
system of equation AX = B can be expresses as:
(a)
LUX = B

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

(b)
(c)
(d)
24.

25.

( )

For the solution of the system of equations:

3x+2y+z = 10; 3x +3y+2z = 14; x+2y+3z = 14
by matrix factorization methods by factorized the square matrix A into lower and
upper triangular matrices L and U, then the the matrix L is equal to:
(a)

3
2
1

3
5/3
4/3

3
0
24/15

(b)

1
2/3
1/3

0
4/5
4/5

0
1
1

(c)

1
3
4/3

1
1
5/3

1
0
1

(d)

1
2
3/4

0
1
3/5

0
0
1

( )

The missing term in the following tabulated values is:

(a)
(c)
26.

(L+U)X = B
LX = UB
(LU) X =B

171

81

27
31

(b)
(d)

29
33

( )

A polynomial of degree two or less which satisface the values (0,1), (1,3), (3,55) will
be equal to:
(a)
10x28x+1
(b)
8x2-6x+1
(c)
4x22x+1
(d)
15x213x+1
( )

For free study notes log on: www.gurukpo.com

172
27.

Newton's background difference interpolation formula is useful, when it is required to

interpolate:
(a)
Near the beginning of tabulated values
(b)
Near the end of the tabulated values
(c)
Near the central part of the tabulated values
(d)
At any intermediate value of the tabulated values
( )

28.

The third divided difference with arguments 2,4,9,10 of the function f (x) = x3 2x
will be equal to:
(a)
26
(b)
15
(c)
1
(d)
23
( )

29.

an interpolation formula, which is obtained by taking the average of gauses forward

and gauss backward interpolation formula, is known is:
(a)
Stirling's interpolation formula
(b)
Bessel's interpolation formula
(c)
Newton general interpolation formula
(d)
Lagrange's interpolation formula
( )

30.

Which piecewise polynomial is a spline function:

(a)
x+1
1 x 0
f (x) =
2x+1
0 x 1
4x
1 x 2

31.

(b)

f (x)

x2+1
2x2
5x2

0
1
2

x 1
x 2
x 3

(c)

f (x)

x2
x2x+1
3x3

0
1
2

x 1
x 2
x 3

(d)

None of the above

Which interpolation formula cannot have any difference operator?

(a)
Stirling's interpolation formula
(b)
Bessel's interpolation formula
(c)
Newton's genral interpolation formula
(d)
Lagrange's interpolation formula

For free study notes log on: www.gurukpo.com

( )

( )

Mathematical Methods for Numerical Analysis and Optimization

32.

From the following table of values of x and y, the value of dy/dx at x = 5 will be:
x
y
(a)
(c)

33.

2
26

3
58

4
7
112 466
(b)
(d)

98
88

( )

In the lagrange's interpolation formula, the sum of lagrangian coefficient is always:

Unity
Greater than unity

(b)
(d)

Less than unity

Zero

( )

From the following table, the area bounded by the curve and the x- axis from x = 7.47
to x = 7.52 (apply trapezoidal rule) is:

(a)
(c)
35.

0
4
116
90

(a)
(c)
34.

173

7.47

7.48

7.49

7.50

7.51

7.52

f (x)

1.93

1.95

1.98

2.01

2.03

2.06

0.0498
0.0996

(b)
(d)

0.1992
0.0249

( )

a river is 80 meters wide. The depth d (in meters) for the river at a distance x from
one bank is given by the following table:
x
y

0
0

10
4

20
7

30
9

40
12

50
15

60
14

70
8

80
3

Then by Simpson's 1/3 rule, the approximate area of cross section of the river will be
equal to:
(a)
700 m2
(b)
705 m2
(c)
710 m2
(d)
805 m2
( )
36.

By Gauses three point quadrature formula, the value of the integral

to:
(a)
(c)

0.693122
0.692231

(b)
(d)

0.691322
0.6901322

For free study notes log on: www.gurukpo.com

is equal

( )

174
37.

If the imposed conditions that are required to solve a differential equation of higher
order are given at more than one-point, then the problem is known is:
(a)
Higher value problem
(b)
Multi-Value problem
(c)
Initial value problem
(d)
Boundary value problem
( )

38.

Given = x +
, with y= 1 for x = 0 then by Euler's modified method (h=0.2) the
value of y at x = 0.2 correct upto four places of decimal is:
(a)
1.2295
(b)
1.23309
(c)
1.5240
(d)
1.5253
( )

39.

Given
= xy, with x = 1, y= 2, then the numerical solution, by runge-Kutta method
of fourth order at x = 12 (take h = 0.2) is:
(a)
2.4921429
(b)
2.39121034
(c)
2.59485866
(d)
2.53933177
( )

40.

Which method for the numerical solution of differential equation, is a multi step
method?
(a)
Euler's method
(b)
Runge-Kutta Method
(c)
Shooting method
(d)
Predictor-corrector method
( )

Answer Key
1. (b)
2. (c)

3. (a)

4. (c)

5. (a)

6. (d)

7. (a)

8. (b)

9. ( c)

10. (d)

11. (b)

12. (a)

13. (a)

14. (c)

15. (b)

16. (a)

17. (a)

18. (d)

19. (b)

20.(c)

21. (b)

22. (c)

23. (a)

24. (b)

25. (c)

26. (b)

27. (b)

28. (c)

29. (a)

30. (d)

31. (d)

32. (b)

33. (a)

34. (c)

35. (c)

36. (b)

37. (d)

38. (b)

39. (a)

40. (d)

__________

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

175

DESCRIPTIVE PART II
Year 2006
Time allowed : 2 Hours
Maximum Marks : 30
Attempt any four questions out of the six. All questions carry 7 marks each.
Q.1

(a)

Discuss the errors that my occur during the floating point arithmetic
operations.

(b)

Find a real root of the equation x3x4 = 0 correct to three places of decimal
using bisection method.

Q.2

(a)

By using newton raphson's method, find the root of x4x10 = 0 which is near
to x=2 correct to three places of decimal.

(b)

By using the secant method, find the smallest positive root of the following
equation.
x33x2+x+1 =0

Q.3

(a)

Find a smallest positive root of the equation:

x39x+1 =0
by using the method of successive approximation, correct to four decimal
places.

(b)

Solve the following system of equations by Gauss elimination method

3x + 6y + z = 16
2x +4y + 3z = 13
x + 3y +2z = 9

Q.4

(a)

Solve the following system of equation by Gauss-Seidel method;

x+3y+z = 10
x+ 2y+5z =13

For free study notes log on: www.gurukpo.com

176
4x+2z=16
Solve the following system of equations by matrix factorization method:
2x+3y+z = 9
x+2y+3z=6
3x+y+2z = 8
(b)

Find the number of men getting wages between Rs. 10 and Rs.15 from the
following table:

Q.5

(a)

Wages (in Rs.)

0-10

10-20

20-30

30-40

No. of Person

30

35

42

By means of Newton's divided difference interpolation formula. Find the vales

of f (2) and f (8) from the following table:

Q.6

10

11

13

f (x)

48

100

294

900

1210

2028

(b)

Evaluate

(a)

Given

= 1 for x =10

Find y approximately for x =0.1 by Euler's method with step size, h = 0.02.
(b)

Solve the equation

x2 + y

With initial condition y (0)= 1.0 by Runge-Kutta method of fourth order from
x=0.1 to x =0.4 with step length h = 0.1.

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

__________

For free study notes log on: www.gurukpo.com

177

178

Keywords
1. Interpolation :- Interpolation is a method of constructing new data points within the
range of a discrete set of known data points.
2. Iterative Methods :- In the problems of finding the root of an equation (or a solution
of a system of equations), an iterative method uses an initial guess to generate
successive approximations to a solution. In contrast, direct methods attempt to solve
the problem by a finite sequence of operations.
3. Transcendental Equations : Equations which involve sine, cosine, trigonometric,
logarithmic and exponential functions.
4. Numerical Differentiation : numerical differentiation describes algorithms for
estimating the derivative of a mathematical function or function subroutine using
values of the function and perhaps other knowledge about the function.
5. Or
6. Numerical differentiation is the process of finding the numerical value of a derivative
of a given function at a given point. In general, numerical differentiation is more
difficult than numerical integration. This is because while numerical integration
requires only good continuity properties of the function being integrated, numerical
differentiation requires more complicated properties

For free study notes log on: www.gurukpo.com

Mathematical Methods for Numerical Analysis and Optimization

Bibliography
1. Numerical Methods and Computing, Cheney & Kincaid, 5 Ed., Thomson.
th

2. Applied Numerical Methods for Engineers, Schilling & Harries, Thomson.

3. Numerical Algorithms, Krishnamurthy & Sen, EWP.
4. Numerical Analysis, R. S. Salaria

For free study notes log on: www.gurukpo.com

179