19148S21BP Revised June 2019 Students admitted from 2019 onwards

PRIST UNIVERSITY
19148S21BP -NUMERICAL METHODS
(COMMON TO ECE,EEE,CIVIL,MECHANICAL) – II SEM
SYLLABUS
For Part-Time 19148S21BP from (2019-20 onwards) – II SEM
Unit – I SOLUTION OF EQUATIONS AND EIGEN VALUE PROBLEMS
Linear interpolation methods (method of false position) - Newton’s method - Statement of Fixed
Point Theorem - Fixed pointer iteration x=g(x) method - Solution of linear system of Gaussian
elimination and Gauss-Jordan methods - Iterative methods: Gauss Jacobi and Gauss – Seidel
methods- Inverse of a matrix by Gauss-Jordan method. Eigen value of a matrix by power
methods.
Unit – II INTERPOLATION AND APPROXIMATION

Lagrangian Polynomials - Divided difference - Interpolation with a cubic spline - Newton

forward and backward difference formulae.
UNIT – III NUMERICAL DIFFERENTIATION AND INTEGRATION
Derivatives from difference table - Divided difference and finite difference - Numerical
integration by Trapezoidal and Simpson’s 1/3 and 3/8 rules - Romberg’s method - Two and three
point Gaussian quadrature formulas - Double integrals using trapezoidal and Simpson’s rules.

UNIT – IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL

EQUATIONS
Single step Methods : Taylor Series and methods - Euler and Modified Euler methods - Fourth
order Runge-Kutta method for solving first and second order equations - Multistep methods –
Milne’s and Adam’s predictor and corrector methods.

UNIT – V BOUNDARY VALUE PROBLEMS

Finite difference solution for the second order ordinary differential equations. Finite difference
solution for one dimensional heat equation by implict and explict methods - one dimensional
wave equation and two dimensional Laplace and Poisson equations.
TEXT BOOKS
1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson
Education Asia, New Delhi.2002.
2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd., New Delhi,
1999.
REFERENCES
1. Kandasamy, [Link], K and Gunavathy, K. “Numerical Methods”, [Link] and
Co. New Delhi.1999
19148S21BP Revised June 2019 Students admitted from 2019 onwards

Unit – I
SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS
Part A (2 marks)
1. Write the iterative formula of Newton Raphson method.
2. What is the order of convergences of Newton- Raphson method if the multiplicity of the root is one?
3. What is the condition for applying the fixed point iteration method to find the real root of the equation
x = f(x)?
4. What is the order of convergence for fixed point iteration?
5. In what form is the coefficient matrix transformed into when Ax =B is solved by Gauss Elimination
and Gauss Jordan methods.
6. For solving a linear system, compare Gaussian elimination method and Gauss Jordan method.
7. Write a sufficient condition for Gauss seidel method to converge.
8. Find the inverse of the coefficient matrix by Gauss Jordan elimination method

9. Determine the largest eigen values and the corresponding eigen vector of the matrix correct

to two decimal places using power method.

10. Why Gauss – Seidel method is a better method than Jacobi’s iterative method?

Part – B

11.(i) Find the positive root between 0 & 1 of correct to two decimal places using Newton-
Raphson’s method. (6)
(ii) Solve the system of equation using Gauss Jordan method.
(10)
12.(i)Solve by the method of fixed point iteration (8)

(ii) Using Gauss Jordan method, find the inverse of the matrix (8)

13.(i)Solve the equation for the positive root by iteration method. (8)

(ii)Using Gauss Jordan method finds the inverse of A= (8)

14.(i) Find an appropriate root of by false position method (8)

(ii) Using Gauss- Seidel method, solve the following equations

(8)

15.( i) Compute the real root of correct to 4 decimal places using the method of false
position. (8)
19148S21BP Revised June 2019 Students admitted from 2019 onwards

(ii) Solve the following system of equation by using Gauss Jacobi method.
(8)

16. Find the numerically largest eigen value of by power method. (16)
19148S21BP Revised June 2019 Students admitted from 2019 onwards

UNIT – II
INTERPOLATION AND APPROXIMATION
Part –A (2 marks)

1. State Lagrange’s interpolation formula.

2. What advantage has the Lagrange’s formula over Newton ?
3. Give the inverse of Lagrange’s interpolation formula.
4. Form the divided difference table for the following data.

X 2 5 10
Y 5 29 109

5. State Newton’s divided difference formula .

6. State Newton’s forward difference formula .
7. State Newton’s backward difference formula .
8. Write Bessel’s central difference formula.
9. Write Stirlings central difference formula.
10. What is cubic spline?

Part – B

11.(i) Find y(2) in the following table using Lagrange’s interpolation (8)

X: 0 1 3 4
Y: 0 1 81 256
(ii)Using Newton’s divided difference formula find f(8) for
x 4 5 7 10 11 13
f(x) 48 100 294 900 1210 2028
12.( i). Find the missing value by Newton’s divided difference formula. (8)

X: 1 2 4 5 6
F(x): 14 15 5 - 9
(ii).Find y when x =46 and x =63 from the following data . (8)
X: 45 50 55 60 65
Y: 114.84 96.16 83.32 74.48 68.48
13.( i). From the data given below, find the number of students whose weight is between 60 to 70 (8)
Weight in Ibs:- 0-40 40-60 60-80 80-100 100-120
[Link] Students:- 250 120 100 70 50
(ii). From the following table find the value of tan(0.28) (8)
x : 0.10 0.15 0.20 0.25 0.30
y : 0.1003 0.1511 0.2027 0.2553 0.3093
19148S21BP Revised June 2019 Students admitted from 2019 onwards

14.( i). From the following table estimate e0.644 correct five decimal places using Bessels formula. (8)
x: 0.61 0.62 0.63 0.64 0.65 0.66 0.67
x
y:e :1.840431 1.858928 1.877610 1.896481 1.915541 1.934792 1.954237

(ii). Given the following table, find y(35) by using strilings formula (8)
x: 20 30 40 50
y: 512 439 346 243

15.( i). Using stirling formula to find f(1.22) (8)

x: 1.0 1.1 1.2 1.3 1.4
y: 0.841 0.891 0.932 0.963 0.985
(ii).From the following table, find y when x=0.5437 using Bessel’s formula (8)
x:0.51 0.52 0.53 0.54 0.55 0.56 0.57
y:0.5292 0.5379 0.5465 0.5549 0.5633 0.5716 0.5798

[Link] the cubic spline approximation for the function y = f(x) from the following data, given that
(16)
x: -1 0 1 2
y: -1 1 3 35
19148S21BP Revised June 2019 Students admitted from 2019 onwards

UNIT – III

NUMERICAL DIFFERENTIATION & INTEGRATION

Part –A (2 marks)

1. Write the formula for , at using forward difference operator.

2. Using Newton’s backward difference formula, write the formulas for first and second
order derivatives at .
3. Write down the formula for Simpson’s one- third rule .

4. State Trapezoidal rule to evaluate

5. State Simpson’s three eighth rules.

6. Evaluate by Trapezoidal rule dividing the range into 4 equal parts.

7. In order to evaluate by Simpson’s rule as well as by Simpson’s rule , what is the

restriction on the number of intervals?

8. Using Simpson’s rule find given &

9. State trapezoidal rule for evaluating .

10. State Simpson’s rule for evaluating .

19148S21BP Revised June 2019 Students admitted from 2019 onwards

PART- B

11. (i) find for following data

(10)
3.0 3.2 3.4 3.6 3.8 4.0
-14 -10.032 -5.296 -0.256 6.672 14.

(ii) Evaluate the integral with h=1/6using trapezoidal rule (6)

12. (i) Find the first, second derivatives of at if (10)

50 51 52 53 54 55 56
3.6840 3.7084 3.7325 3.7563 3.7798 3.8030 3.8259

(ii) Using trapezoidal rule, evaluate taking 8 intervals. (6)

13. Dividing the range into 10 equal parts find the value of by (16)

a) trapezoidal rule b) Simpson’s rule and also check the result by direct integration

14. Evaluate using Romberg’s method. Hence obtain an approximate value for .(16)

15.) i) Evaluate with by trapezoidal rule (8)

ii) Using Simpson’s rule evaluate with (8)

[Link] using trapezoidal and Simpson’s rule also by actual

integration. (16)
19148S21BP Revised June 2019 Students admitted from 2019 onwards

UNIT – IV

INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS

Part –A (2 marks)
1. Write down the fourth order Taylor algorithm .
2. State the disadvantage of Taylor series method.
3. Write down the Euler algorithm to the differential equation.
4. State modified Euler algorithm to solve at.
5. Write the Runge- kutta algorithm of second order for solving .
6. Write down the Runge-kutta formula of fourth order.
7. Write Milne’s predictor corrector formula.
8. write down Adams –Bashforth predictor formula.
9. Compare Runge –Kutta metheods and Predictor- corrector methods for solution of intial
value problem.
10. How many prior values are required to predictor formula.?
Part – B
11. (i)Solve with use Taylor series find y at (10)

(ii) Using Euler’s method find given by assuming . (6)

12. Using Taylor’s method solve with find (16)

(1) (2) , (3) .

13. Solve by modified Euler’s method to find , , (16)

14. By fourth order R-K method find with from (16)

15. Using Milne’s method find if is the solution of given

and (16)

16. Given . Evaluate

by Adams –Bash fourth method.

(16)
19148S21BP Revised June 2019 Students admitted from 2019 onwards

Unit – V
BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL
EQUATIONS.

PART - A

1. State the conditions for the equation.

where A,B,C,D,E,F,G are function of x and y to be
(i)elliptic (ii)parabolic (iii)hyperbolic.

2. What is the classification of

3. Give an example of a parabolic equation.
4. What is the equation of one dimensional heat flow equation?
5. What type of equations can be solved by using crank-nickolson’s difference formula?
6. Write a note on the stability and convergence of solutions of the difference equations corresponding
to the hyperbolic equation

7. Write the diagonal five-point formula to solve the Laplace equations

8. What is the purpose of Liebmann’s process?
9. Define a difference quotient.
10. Write down the finite difference form of the equation.

PART –B

11. Solve taking h= 0.25 for t>0 ,0<x<1 and u(x,0) =0, u(0,t) =0 u(1,t)= t. (16)

12. Solve given that

compute u for the time step with h=1 by Crank- Nicholson method.
(16)

[Link] , taking

h= 0.2 upto one half of the period of vibration by taking appropriate time step. (16)
[Link] a finite difference scheme to solve the Laplace equation. Solve at the
pivotal points in the square shown fitted with square mesh. Use leibmann’s iteration
19148S21BP Revised June 2019 Students admitted from 2019 onwards

procedure. (16)

1000 1000 1000 1000

2000 500

2000 0

1000 500 0 0

[Link] , the boundary conditions are given below.(give only three iteration) ?
0 10 20 30 (16)

20

20 40

40 50

60 60 60 60

16. Solve the Poisson equation over the square with sides x =0,y =
0,x =3,y=3 with u=0 on the boundary, taking h=1. (16)
19148S21BP Revised June 2019 Students admitted from 2019 onwards

Keys
UNIT – II
INTERPOLATION AND APPROXIMATION
Part –A (2 marks)

[Link] Lagrange’s interpolation formula.

y = f(x) = (x-x1)(x-x2)(x-x3)
2. What advantage has the Lagrange’s formula over Newton ?
3. Give the inverse of Lagrange’s interpolation formula.
4. Form the divided difference table for the following data.

X 2 5 10
Y 5 29 109

5. State Newton’s divided difference formula .

6. State Newton’s forward difference formula .
7. State Newton’s backward difference formula .
8. Write Bessel’s central difference formula.
9. Write Stirlings central difference formula.
10. What is cubic spline?