Numerical Methods QB 11148S51B 12148S51B
Numerical Methods QB 11148S51B 12148S51B
Numerical Methods QB 11148S51B 12148S51B
PRIST UNIVERSITY
11148S51B/12148S51B-NUMERICAL METHODS
(COMMON TO ECE,EEE,CIVIL,MECHANICAL)
SYLLABUS
Unit I
Linear interpolation methods (method of false position) - Newtons 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
Derivatives from difference table - Divided difference and finite difference - Numerical
integration by Trapezoidal and Simpsons 1/3 and 3/8 rules - Rombergs method - Two and three
point Gaussian quadrature formulas - Double integrals using trapezoidal and Simpsons rules.
UNIT IV
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
Milnes and Adams predictor and corrector methods.
UNIT V
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.
11148S51B/12148S51B
PRIST UNIVERSITY
NUMERICAL METHODS
11148S51B/12148S51B
(COMMON TO ECE,EEE,CIVIL,MECHANICAL)
(Students admitted on 2011 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
5 x 2 y 10;3 x 4 y 12
1 1
correct
9. Determine the largest eigen values and the corresponding eigen vector of the matrix
1 1
to two decimal places using power method.
10. Why Gauss Seidel method is a better method than Jacobis iterative method?
Part B
11.(i) Find the positive root between 0 & 1 of x 3 6 x 4 correct to two decimal places using NewtonRaphsons method.
(6)
(ii) Solve the system of equation using Gauss Jordan method.
x 3 y 3 z 16 ; x 4 y 3 z 18; x 3 y 4 z 19
(10)
x
12.(i)Solve e 3 x 0 by the method of fixed point iteration
(8)
2
(ii) Using Gauss Jordan method, find the inverse of the matrix 2
4
2
6
8
6
8
(8)
13.(i)Solve the equation x 3 x 2 100 0 for the positive root by iteration method.
(8)
(8)
1
3
4
3
4
(8)
11148S51B/12148S51B
4 x 2 y z 14
(8)
x 5 y z 10
x y 8 z 20
15.( i) Compute the real root of x 3 4 x 1 0 correct to 4 decimal places using the method of false
position.
(8)
(ii) Solve the following system of equation by using Gauss Jacobi method.
8 x 3 y 2 z 20;4 x 11 y z 33;6 x 3 y 12 z 35
(8)
1
3
4
3
1 by power method.
5
(16)
11148S51B/12148S51B
UNIT II
INTERPOLATION AND APPROXIMATION
Part A (2 marks)
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
2
5
5
29
10
109
Part B
11.(i) Find y(2) in the following table using Lagranges interpolation
(8)
X:
0
1
3
4
Y:
0
1
81
256
(ii)Using Newtons divided difference formula find f(8) for
11
13
x
4
5
7
10
1210
2028
f(x)
48
100 294
900
12.( i). Find the missing value by Newtons 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
No.of 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
11148S51B/12148S51B
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
x:
20
30
40
y:
512
439
346
(8)
50
243
(8)
1.4
0.985
0.56
0.5716
(8)
0.57
0.5798
16.Obtain the cubic spline approximation for the function y = f(x) from the following data, given that
y 0'' y 3'' 0
x:
y:
(16)
-1
-1
0
1
1
3
2
35
11148S51B/12148S51B
UNIT III
NUMERICAL DIFFERENTIATION & INTEGRATION
Part A (2 marks)
2
dy d y
,
at x x0 using forward difference operator.
dx dx 2
2. Using Newtons backward difference formula, write the formulas for first and second
order derivatives at x xn .
3. Write down the formula for Simpsons one- third rule .
x
f ( x ) dx
6. Evaluate
xn
7. In order to evaluate
x0
3
rule , what is
8
e 4 54.6.
b d
f x, y dydx .
a c
b d
f x, y dydx .
a c
11148S51B/12148S51B
PART- B
11.
3.6
-0.256
3.8
6.672
4.0
14.
dx
2 with h=1/6using trapezoidal rule
0 1 x
dx
1 x
(6)
(10)
taking 8 intervals.
13. Dividing the range into 10 equal parts find the value of
sin xdx by
(6)
(16)
a) trapezoidal rule b) Simpsons rule and also check the result by direct integration
2
14. Evaluate
dx
using Rombergs method. Hence obtain an approximate value for .(16)
4
2 2
15.) i) Evaluate
xy
x y dxdy
1 1
(8)
1 1
1 x y dxdy
with h k 0.25
(8)
0 0
/2 /2
16.Evaluate
integration.
(16)
11148S51B/12148S51B
UNIT IV
INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS
1.
2.
3.
4.
Part A (2 marks)
Write down the fourth order Taylor algorithm .
State the disadvantage of Taylor series method.
Write down the Euler algorithm to the differential equation.
1
State modified Euler algorithm to solve y f x, y , y x0 y 0 at.
1
5. Write the Runge- kutta algorithm of second order for solving y f x, y , y x0 , y 0 .
6.
7.
8.
9.
11. (i)Solve
dy
1 2 xy with y 0 0. find
dx
(10)
(6)
(16)
if
dy
x 2 y 2 , y 0 1
dx
y x is the solution of
dx
dy
1
2
(16)
x y given
(16)
16. Given
dx
x 2 1 y , y 1 1, y 1.1 1.233, y 1.2 1.548, y 1.3 1.979 .
dy
(16)
Evaluate
11148S51B/12148S51B
Unit V
BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL
EQUATIONS.
PART - A
u x u yy 0.
0.
PART B
11. Solve
12. Solve
xx
32u
taking h= 0.25 for t>0 ,0<x<1 and u(x,0) =0, u(0,t) =0 u(1,t)= t. (16)
u 2 u
in0 x 5, t 0
t x 2
compute u for the time step with h=1 by Crank- Nicholson method.
(16)
11148S51B/12148S51B
2u 2u
15.Solve 2 2 ,
x
t
u
( x,0) 0, taking
t
h= 0.2 upto one half of the period of vibration by taking appropriate time step.
(16)
14.Obtain a finite difference scheme to solve the Laplace equation. Solve 2 u 0 at the
pivotal points in the square shown fitted with square mesh. Use leibmanns iteration
procedure.
(16)
1000
1000
1000
1000
2000
500
2000
0
0
1000
500
15.Solve 2 u 0 , 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 2 u 10( x 2 y 2 10) over the square with sides x =0,y
= 0,x =3,y=3 with u=0 on the boundary, taking h=1.
(16)