NATIONAL INSTITUTE OF TECHNOLOGY, JAMSHEDPUR, JHARKHAND-831014

Department of Mathematics

Course Hand out for MCA, 2ND (Spring) Semester, 2018 Batch, Session: 2018-19
Course No.: MH 32102, Course Title.: Computer oriented numerical techniques. Credit: 4

Instructor-in-charge: Dr. Hari Shankar Prasad Date: 03-01-2019

---------------------------------------------------------------------------------------------------------------------------------------

Course Description

Unit : 1
Representation of numbers: Floating point representation of numbers, Floating point arithmetic operations,
normalization, pitfalls of floating point representation, error in numerical computation. Iterative methods: Zeros of
algebraic and transcendental equations using Bisection method, Iteration method, Regula-Falsi method, Newton-Raphson
Method. Rate of convergence of iterative methods.
Unit : 2
Simultaneous Linear Equations: Solution of System of Linear Equations, Gauss elimination method and pivoting strategy,
Ill-conditioned system of equations, Refinement of solution, Gauss-Seidel iterative method, Rate of convergence.
Unit: 3
Interpolation and Approximation: Finite differences, Forward, Backward and Central difference tables. Polynomial
interpolation: Newton Forward and Backward difference interpolations. Central difference formulae: Gauss Forward and
Backward formula. Interpolation with unequal intervals: Lagrange’s interpolations, Newton Divided difference
interpolation. Linear, Quadratic and Cubic-Spline interpolation.
Unit: 4
Least square approximation: Least square approximation by polynomials and non-linear curves, Orthogonal polynomials,
Gram-Schmidt orthogonalization process, Approximations of functions by Chebyshev polynomials.
Unit: 5
Numerical differentiation and integration: Numerical differentiation, Numerical Integration: Quadrature formula,
Trapezoidal rule, Simpson’s rules.
Unit: 6
Numerical solution of ordinary differential equations: Taylor’s series method, Euler’s method, Predictor Corrector
method, Runge - Kutta second and fourth order methods.

Scope

# To provide good fundamental concepts of numerical methods to solve scientific problems.

# To make proficient in computer oriented numerical techniques.

Objective
• At the end of this course, the students will be able to understand the importance and
effectiveness of computer oriented numerical methods.
• At the end of this course, the students will be able to apply the Numerical Techniques,
effectively, in solving various kind of scientific problems.

Text Books

T1: Jain, M.K., Iyengar, S.R.K. and Jain, R.K., “Numerical Methods for Scientific and
Engineering Computation”, 6th Edition, New Age International (P) limited, Publishers,
New Delhi, 2012.
T2: Grewal, B.S. and Grewal, J.S., “Numerical Methods in Engineering and Science with
Programs in Fortran 77, C & C++ “, 10th Edition, Khanna Publishers, Delhi, 2014.

Reference Books

R1: Conte S. D. & Boor, C. D., “Elementary Numerical Analysis, An Algorithmic

Approach”, 3rd edition, McGraw-Hill Book Company, International edition,1981.
R2.: Atkinson, K.E., “An Introduction to Numerical Analysis “, 2nd Edition, Reprint, Wiley India
(P), Ltd., New Delhi, 2008.
 Course Plan

Lecture Learning objectives Topics to be covered Refer to

No. Chapter,
See(Book)
1-3 Representation of Floating point representation of numbers, Floating point arithmetic 1(T1,
numbers operations, normalization, pitfalls of floating point representation, R1&R2)
error in numerical computation.
.
4-9 Solution of algebraic Zeros of algebraic and transcendental equations using Bisection 2(T1&T2)
and transcendental method, Iteration method, Regula-Falsi method, Newton-Raphson
equations Method. Rate of convergence of iterative methods
10-15 Solution of Solution of System of Linear Equations, Gauss elimination direct 3(T1, T2)
Simultaneous linear method and pivoting strategy, Ill-conditioned system of equations,
equations Refinement of solution, Gauss-Seidel iterative method, Rate of
convergence.

16-24 Polynomial Finite differences, Forward, Backward and Central difference 4(T1),
Interpolation tables. Newton Forward and Backward difference interpolations. 6-7(T2)
Central difference interpolation formulae: Gauss Forward and
Backward formula. Interpolation with unequal intervals:
Lagrange’s interpolations, Newton Divided difference
interpolation. Linear, Quadratic and Cubic-Spline interpolation.

25-31 Least square Least square approximation by polynomials and non-linear curves, 4(T1),5(T2)
approximation Orthogonal polynomials, Gram-Schmidt orthogonalization process,
Approximations of functions by Chebyshev polynomials
32-37 Numerical Numerical differentiation, Maxima and Minima of tabulated 5(T1),
differentiation and functions. Newton-Cotes Quadrature formula, Trapezoidal rule, 8(T2)
Integration Simpsons 1/3 rule, Simpson 3/8 rule and their error estimations.
38-44 Numerical solution of Taylor’s series method, Euler’s method, Predictor Corrector 6(T1),
ordinary differential method, Runge-Kutta second and fourth order methods, Stability 10(T2),
equations of numerical methods.

Evaluation Scheme

ES Evaluation Component Duration Weightage Date Nature of the

No. &Time Component
1 End Sem Exam. 2 Hrs. 30% As per Closed Book
2 End Sem Exam. 3 Hrs 50% academic Closed Book
calender
TEACHER ASSESSMENT
3 Home Assignment …… 05% . Open Book
4 Attendance …… 05% . Open
5 Surprise Quizes/ClassTests …… 10% . Closed Book

Chamber consultation hour: Friday: 5-6 pm

Notices: All notices regarding the course will be displayed only on the Department of the Mathematics notice board.

Instructor In-charge

MH 32102
 NATIONAL INSTITUTE OF TECHNOLOGY, JAMSHEDPUR, JHARKHAND-831014

Department of Mathematics

HOME ASSIGNMENT for MCA, 2ND (Spring) Semester, 2018 Batch, Session: 2018-19

Course No.: MH 32102, Course Title.: Computer oriented numerical techniques. Credit: 4

Instructor-in-charge: Dr. Hari Shankar Prasad Date: 03-01-2019

1. Describe different number system in detail.

2. What are 1’s and 2’s complement of the following decimal numbers:
(i) 124 (ii) 256 (iii) 113 (iv) -56 (v) -41 (vi) -27
3. Obtain the following:
(i) (FACE)16=( ? )2 (ii) (101.0110 )2 = ( ? )10 (iii) (011001.001110)2= ( ? )8
(iv) (11011101.0111)2 =( ? )10
(v) (3BF.5C)16 =( ? )2 (vi) (3ABC)16 =( ? )8 (vii) (39.B8)16 =( ? )8 (viii) (56.08)16 =( ? )10
(ix) (24.6)8 =( ? )10
4. Subtract using 8 bit mantissa word and verify the result by obtaining decimal equivalent:
(i) (1100110)2 from (11101011)2 (ii) (1101)2 from (111001)2 (iii) (10110100)2 from (10010101)2
(iv) (111)2 from (100)2 (v) (11011.0001)2 from (11110.11)2 (vi) (010111)2 from (101011)2
5. Add the following binary numbers and verify the result by obtaining decimal equivalent:
(i) (1110.1101)2 and (110101.00101)2 (ii) (1110.11)2 and (11011011.111)2
6. Define the following with example:
(i) Absolute error (ii) Relative error (iii) Inherent error (iv) Round-off error (v) Truncation error
(vi) Chopping error (vii) Bugs and Debugging (viii) Overflow and Underflow on computer.
7. Find the round-off error in the results of the following arithmetic operations, using four digit mantissa.
(i) 27.65+22.20 (ii) 87.26+31.42 (iii) 1250.0 X 40.0 (iv) 3543.0+16.78 (v) 25.68 / 6.567
(vi) 456.7-1.531 (vii) 456.7-4.566
8. Explain the concept of significant digit and show the situations where there is a loss of significant
digit and magnification of errors in the result.
9. What are fixed and floating point representation of numbers ? Explain with example.
10. Discuss an example to show that the distributive low of arithmetic is not always satisfied in numerical computing.
11. What are induced and inherent instability? When these arises?
12. Define condition number. What is its significance in numerical computing?
13. Compute and interpret the condition number for the following functions:
1 5 1/ 3
(i) f ( x) = Sinx (ii) f ( x) = (iii) f ( x ) = x (iii) f ( x ) = x
1− x
14. Using maximum norm compute and interpret the condition number for the following matrices:
1 4 9
 1 −2   − 0 .6 0 .6   
(i)   (ii)   (iii) 4 9 16
 
− 0.99 1.99  0 .4 0 .2 
 9 16 25
15. Check whether the following system of equations are ill or well conditioned:

1 0 7 8 7   x1  32.
7  x   
 1 − 2   x1  2.1  5 6 4   2  = 23 
(i) − 0.99 1.99  x  6.2
= (ii)
8 6 10 9   x3  33 
   2  
     
7 5 9 10  x 4  31 
2 1  x1  2. 
(iii) 2.01 1  x  = 2.05
   2  

16. Show that the following system of equations is ill-conditioned for computing the point of
intersection when m1 and m2 are nearly equal. y = m1 x + c1 ; y = m2 x + c 2 .

17. Compute the difference of square roots of two numbers x = 497.0 and x = 496.0 .
Suggest an another approach by rearranging the terms to improve the result.
18. Explain the computational methods for estimation of the error associated with the final result.
19. Using Newton-Raphson method, find the root of the following equations correct
to three decimal places:
i) x sinx + cosx = 0 ii) ex = x3 + cos25x iii) logx –x +3=0 iv) 3x3 -9x2 +8=0

20. Find the iterative formulae for finding √N, (N)1/3 where N is a real number, using Newton-Raphson formula.
Hence evaluate: (a) √32 (b) (41)1/3 to four places of decimal.
21. Evaluate the following using Newton-Raphson method:
i) 1/18 ii) 1/√15 iii) 28-1/4
22. Define the Rate of convergence of iterative procedures and find the Rate of convergence of
Bisection method, Fixed point iteration method, Regula-falsi method, Newton-Raphson method and
Secant method.
23. Show that the Regula-Falsi and Fixed-point iteration methods are linearly convergent methods.
24. Using Bisection method, Regula-falsi method, Secant method and Fixed point iteration method,
find the real root of the following equations correct to three decimal places:
i) x sinx + cosx=0 ii) ex = x3 + cos25x iii) logx –x +3=0 iv) 3x3 -9x2 +8=0
25. (i) Solve the following system of equations by (i) Gaussian elimination method and (ii) Gauss Seidel method
respectively.

(a) 2 x − 6 y + 8 z = 24; 5 x + 4 y − 3 z = 2 ; 3 x + y + 2 z = 16

(b) x + y + z = 1; 4 x + 3 y − z = 6 ; 3 x + 5 y + 3 z = 4

(c) 5 x − 2 y + z = 4; 7 x + y − 5 z = 8 ; 3 x + 7 y + 4 z = 10

(d) 3 x + 2 y + 4 z = 7; 2 x + y − 2 z = 7 ; x + 3 y + 5 z = 2

Refine the solutions obtained by Iterative refinement procedure in each case.

(ii) Find the Rate of convergence of Gauss Seidel method,

26. Define forward, backward and central differences by forming difference table in each case and
show that any higher order differences can be expressed in terms of entries.
27. Show that the n-th difference of a n-th degree polynomial is constant and all higher order
differences are zero.
28. Extend the following table to two more terms on either side by constructing the difference table:

x -0.2 0.0 0.2 0.4 0.6 0.8 1.0

y 2.6 3.0 3.4 4.28 7.08 14.2 29.0

29. Evaluate :
(i) ∆4[(1-x)(1-2x)(1-3x)(1-4x)],(h=1), (ii) ∆10 [(1-x)(1-2x2)(1-3x3)(1-4x4)], (h=2),
where h is the interval of differencing.
30. Express 3x4-4x3+6x2+2x+1 as a factorial polynomial and find differences of all orders.
31. Obtain the function whose first difference is 2x3+3x2-5x+4.
32. Find the missing values in the following table:
X 0 5 10 15 20 25
Y 6 10 -- 17 -- 31

33. Prove that

(i) ∆= µ δ + (δ2/2) (ii) ∆= (1/2)δ2+δ√(1+ δ2/4)
(iii) (E1/2 + E-1/2)( (1+∆)1/2 =2+∆ (iv) hD=log(1+∆)=sinh-1(µδ) (v) µ2=1+δ2/2

34. Derive Lagrange’s interpolation formula and hence find the unique polynomial of degree 3 or less, such that
f (0) = 1, f (1) = 3, f (3) = 55, f (5) = −10.
35. Using Lagrange’s interpolation formula, express the function (x2 + 6x-1)/((x2 -1)(x-4)(x-6)) as a sum of partial
fractions.

36. Find the error associated with Polynomial interpolation formula.

37. What do you mean by spline interpolation ? Obtain the (i) Linear (ii) quadratic and (iii) cubic spline
interpolation polynomial that passes through the points (4, -43), (7, 83), (9, 327) and (12, 1053).

38. Using Lagrange’s inverse interpolation formula, find the root of the equation f(x)=0 , given that
f(30)= -30, f(34)= -13, f(38)= 3 and f(42)= -18.
39. Derive Newton divided interpolation formula and find the value of f(27) , given that
 f(20)= 0, f(34)= -13, f(35)= 3 and f(42)= -18.
40. The area A of a circle of diameter d is given for the following values:
d 80 85 90 95 100
A 5026 5674 6362 7088 7854
Calculate the area of a circle of diameter 105, using Newton backward interpolation formula.
41. Find the number of men getting wages between Rs. 10 and 15 from the following data using Newton forward
interpolation formula:
Wages in 0 - 10 10 - 20 20 - 30 30 - 40
rupees
frequency 09 30 35 42

42 . The pressure p of wind corresponding to velocity v is given by the following data.

Estimate p when v=25 by Newton backward interpolation formula.
v 10 20 30 40
p 1.1 2 4.4 7.9

43. The following table gives the viscosity of an oil as a function of temperature. Use
Newton divided interpolation formula to find the viscosity of oil at a temperature of 1400.
Temp.0 110 130 160 190
Viscosity 10.8 8.1 5.5 4.8
44. Given the following values of x and y,find dy/dx and d2y/dx2 at
(a) x=1.0, (b) x=1.15, (c) x=1.25 , (d) x=1.28.
x 1.0 1.05 1.10 1.15 1.20 1.25 1.30
y 1.0000 1.0247 1.0488 1.0723 1.0954 1.1180 1.1401

45. Using the following data, find x for which y is minimum and find this value of y.
x 0.60 0.65 0.70 0.75
y 0.6221 0.6155 0.6138 0.6170
46. Apply the method of Least squares to fit the curve y=ax2 + b/x to the following data:
x 1 2 3 4
y -1.51 0.99 3.88 7.66
47. (a) Obtain the least square approximation of the form f ( x) = a x b to the data

x 0.5 0.6 0.7 0.8 1.0

f(x) 0.3136 0.4145 0.6146 0.8027 1.2542

(b) Obtain the Chebyshev polynomial approx. ofsecond degree to the function f ( x) = ax 3 on [0,1].

(c) Define the orthogonality of a set of functions and explain the Gram-Schmidt orthogonalization process.
(d) Using Gram-Schmidt orthogonalization process, compute the first three orthogonal polynomials which are
orthogonal on [0, 1] with respect to the weight function w(x)=1. Using these polynomials obtain the least square
3
approximation of second degree for f ( x ) = x − 4 x on [0, 1].
(e) Compute the first three polynomials which are orthogonal on [-1, 1] with respect to the weight function w(x)=
1/ x 2 + 1 . Using these polynomials obtain the least square approximation of second degree for f ( x ) = x on [-1,
1].

48. The voltage v across a capacitor at time t seconds is given by the following table:
t 0 2 4 6 8
v 150 63 28 12 5.6
Use the method of Least squares to fit the curve of the form v = a et to this data.
49. The following table gives the results of the measurements of train resistance ; V is the velocity in miles per hour, R
is the resistance in pounds per ton:
V 20 40 60 80 100 120
R 5.5 9.1 14.9 22.8 33.3 46.0
If R is related to V by the relation R = a + bV +Cv2, find a, b and c.
1
1
50. Evaluate ∫ 1 + x dx dx taking seven ordinates by applying Simpson 3/8 rule. Deduce the value of log 2.
0
e
 π /2 π /2
x
51. Evaluate the integrals (i) ∫
0
sin x dx and (ii) ∫
0
sin x
dx using (i) Simpson 1/3- rule and (ii) Trapezoidal rule

of integration by taking eleven ordinates.

52. The velocity v of a particle at distance s from a point on its path is given by the table:
s ft. 0 10 20 30 40 50 60
v 47 58 64 65 61 52 38
ft./sec.
Estimate the time taken to travel 60 ft by using Simpson 1/3- rule. Compare the result with Simpson 3/8 rule.
53. The following table gives the velocity v of a particle at time t :
t (seconds) 0 2 4 6 8 10 12
v(m/sec.) 4 6 16 34 60 94 136
Find the distance moved by the particle in 12 seconds and also the acceleration at t=2 seconds.
54. Evaluate the following integrals using using (i) Simpson 1/3- rule (ii) Simpson 3/8- rule and
(iii) Trapezoidal rule of integration by taking seven ordinates respectively and find out which one is better.
4 2

∫ (1 + x ∫e
4 − x2
(i) ) dx (ii) dx.
2 −2

55. Using Taylor series method, compute y(0.1) and y(0.2) to three places of decimal from the following:

(i) dy/dx = 1 – 2xy given that y(0)=0 , (ii) dy/dx = xy +1, y(0)=1 (iii) dy/dx = x2 + y2 ,y(0)=1

56. Solve the following initial value problem dy/dx = -xy2 , y=2 at x=0 by Euler’s modified method to obtain y at
x=0.2 in steps of 0.1, correct to four decimal places.
57. Solve the differential equation dy/dx =2 +√(xy), where y(1)=1 by Euler’s modified method to obtain y at x=2 in
steps of 0.2, correct to four decimal places.

58. Apply Runge-Kutta method of order Two and Four respectively to solve the following initial value problems for
y(0.2) by taking h=0.1 and hence compare the result.
(i) 10 (dy/dx) = x2 +y2 , y(0)=1 (ii) dy/dx =3x + y/2, y(0)=1
(iii) dy/dx =(2xy +ex)/(x2+xex), y(0)=1

59. Discuss the stability of Numerical methods for the solution of initial value problems.

60. Find the value of y (0.2) and y (0.4), using Runge-Kutta method of fourth order with h = 0.2 given that
dy
= x 2 + y ; y ( 0 ) = 0 .8 .
dx
dy 1 y
61. Given that = − , y (1) = 1, y (1.1) = 0.996, y (1.2) = 0.986 and y (1.3) = 0.972, find the values of
dx x 2 x
y (1.4) and y (1.5) using Milne’s Predictor-corrector method.
**********************************************************************************************