Lesson Plan

L T P C
15MA206 NUMERICAL METHODS

4 0 0 4
Co-requisite: NOT APPLICABLE
Prerequisite: 15 MA102 (or) 15MA104 (or) 15MA205B
Data Book /
NA
Codes/Standards
Course Category B CORE MATHEMATICS
Course designed by Department of Mathematics
Approval -- Academic Council Meeting -- 2016
PURPOSE To acquire analytical ability in solving mathematical problems numerically as applied to the
respective branches of Engineering.
INSTRUCTIONAL OBJECTIVES STUDENT
OUTCOMES
At the end of the course, student will be able to
1 To familiarise with numerical solution of equations a e
2 To get exposed to finite differences and interpolation a e
3 To be thorough with the numerical Differentiation and integration a e
4 To find numerical solutions of ordinary differential equations a e
5 To find numerical solutions of partial differential equations a e
C-
Contact IO
Session Description of Topic D-I- Reference
Hours s
O
UNIT I – CURVE FITTING AND NUMERICAL 14
SOLUTION
1. OF– EQUATIONS
Introduction Method of Least Squares – Curve fitting. 2 C,I 1 1–7
Fitting a straight line –Calculation of the sum of the squares
2. 1 C,I 1 1–7
of the residuals.
Fitting a parabola – Calculation of the sum of the squares of
3. 2 C,I 1 1–7
the residuals.
Solution of Algebraic and Transcendental equations
4. 1 C,I 1 1–7
Newton-Raphson method.
5. Bisection method and its applications. 1 C,I 1 1–7
6. Problems using Method of false position. 1 C,I 1 1–7
7. Solution of system of equations 1–7
1 C,I 1
Direct Method - Gauss Elimination method.
8. Iterative Methods - Gauss Jacobi method, Gauss Seidel 1–7
2 C,I 1
method.
9. Finding the Eigen values by Power method. 2 C,I 1 1–7
10. More Problems in Power method. 1 C,I 1 1–7
UNIT II – FINITE DIFFERENCES AND 12
INTERPOLATION
Introduction – First and Higher order differences – Forward
11. differences and backward differences (only definitions 2 C 2 1–7
without proof).
12. Central Differences – Shifting operator E – Relations 2 C 2 1–7
between the operators (only definitions without proof).
13. Interpolation – Newton-Gregory Forward and Backward 2 C,I 2 1–7
Interpolation formulae.
14. Additional problems using Newton-Gregory Forward and 2 C,I 2 1–7
Backward Interpolation formulae.
15. Divided differences – Newton’s Divided difference formula. 2 C,I 2 1–7
16. Lagrange’s Interpolation formula – Inverse interpolation. 2 C,I 2 1–7
UNIT III – NUMERICAL DIFFERENTIATION AND 10

INTEGRATION
17. Introduction to Numerical Differentiation. 1 C 3 1–7
Numerical Differentiation - Newton’s forward and backward
18. differences formulae to compute first and higher order 2 C,I 3 1–7
derivatives.
Applications of Newton’s forward and backward differences
19. 2 C,I 3 1–7
formulae to compute first and higher order derivatives.
20. Introduction - Numerical Integration 1 C,I 3 1–7
Trapezoidal rule – Simpson’s one third rule and Simpson’s
21. 2 C,I 3 1–7
three eighth rules.
More problems using Trapezoidal rule – Simpson’s one third
22. 2 C,I 3 1–7
rule and Simpson’s three eighth rules.
UNIT IV – NUMERICAL SOLUTIONS OF FIRST 12
ORDER ORDINARY DIFFERENTIAL EQUATIONS
23. Introduction, Solution by Taylor’s series method. 2 C,I 4 1–7
24. Solutions of I order simultaneous differential equations by 1–7
1 C,I 4
Taylor’s series method.
25. Euler’s method and its applications. 1 C,I 4 1–7
26. Problems in Improved and modified Euler methods. 2 C,I 4 1–7
27. Solution by Runge-Kutta method of fourth order (No proof). 2 C,I 4 1–7
28. Additional problems using Runge-Kutta method of fourth 1–7
1 C,I 4
order.
29. Predictor-Corrector Methods - Milne-Thomson Method. 2 C,I 4 1–7
30. Predictor-Corrector Methods - Adam’s Bashforth method. 1 C,I 4 1–7
UNIT V – NUMERICAL SOLUTIONS OF PARTIAL
12
DIFFERENTIAL EQUATIONS
31. Introduction - Solutions of Elliptic Equations. 1 C,I 5 1–7
Solutions of Laplace Equations by Leibmann’s Iterative
32. 2 C,I 5 1–7
process.
33. Solutions of Poisson Equations. 1 C,I 5 1–7
34. Solutions of Parabolic equations by Bendre-Smidth formula. 2 C,I 5 1–7
35. Solutions of Parabolic equations by Crank-Nicolson formula. 2 C,I 5 1–7
36. Solutions of Hyperbolic equations by Explicit formula. 2 C,I 5 1–7
More problems in Hyperbolic equations using Explicit
37. 2 C,I 5 1–7
formula.
Total Contact Hours 60
LEARNING RESOURCES:
Sl. No. TEXT BOOKS
B.S. Grewal, Numerical Methods in engineering and science, Khanna Publishers, 42nd edition,
1. 2012.
Dr. M.K. Venkataraman, Numerical Methods in Science and Engineering, National Publishing
2. Co., 2005.
REFERENCE BOOKS/OTHER READING MATERIAL

3. S.S. Sastry, Introductory Methods of Numerical Analysis, 4th edition, 2005.
E. Balagurusamy, Computer Oriented Statistical and Numerical Methods – Tata McGraw Hill.,
4.
2000.
M.K.Jain, SRK Iyengar and R.L.Jain, Numerical Methods for Scientific and Engineering
5.
Computation, Wiley Eastern Ltd., 4th edition, 2003.
6. M.K.Jain, Numerical Solution of Differential Equations, 2nd edition (Reprint), 2002.
7. P.Kandasamy etal., Numerical Methods, S.Chand & Co., New Delhi, 2003.
Course nature Theory

Assessment Method (Weightage 100%)
Assessment Cycle test Cycle test Cycle Test Surprise
Quiz Total
In-semester tool I II III Test
Weightage 10% 15% 15% 5% 5% 50%
End semester examination Weightage : 50%

Lesson Plan

Uploaded by

Copyright:

Available Formats

Lesson Plan

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lesson Plan

Uploaded by

Copyright:

Available Formats

L T P C

15MA206 NUMERICAL METHODS

16. Lagrange’s Interpolation formula – Inverse interpolation. 2 C,I 2 1–7

UNIT III – NUMERICAL DIFFERENTIATION AND 10

REFERENCE BOOKS/OTHER READING MATERIAL

Course nature Theory

You might also like