This course will enable the students to -
Course Outcomes (COs):
Course |
Learning outcomes (at course level) |
Learning and teaching strategies |
Assessment Strategies |
|
---|---|---|---|---|
Course Code |
Course Title |
|||
DMAT501B |
Numerical Analysis(Theory)
|
The students will be able to – CO44: Apply various interpolation methods and finite difference concepts to solve interpolation problems for equal intervals. CO45: Describe the concept of central difference, Numerical differentiation and be able to solve interpolation problems for unequal intervals. CO46: Understand the concept of Numerical Integration and be able to solve related problems. CO47: Apply numerical methods to find our solution of CO48: Solve the system of linear equations and ordinary differential equations by numerical methods. CO49: Provide suitable and effective methods called Numerical Methods, for obtaining approximate representative numerical results of the problems. |
Approach in teaching: Interactive Lectures, Discussion, Power Point Presentations, Informative videos
Learning activities for the students: Self learning assignments, Effective questions, presentations, Giving tasks |
Quiz, Poster Presentations, Power Point Presentations, Individual and group projects, Open Book Test, Semester End Examination
|
(Note: Non-Programmable scientific calculator up to 100 MS is permitted)
Differences, Relation between differences and derivatives, Difference of polynomials, Factorial notation, Newton’s forward and backward interpolation formula (with proof).
Divided differences: Newton’s and Lagrange’s divided differences formulae. Central differences: Gauss’s, Sterling’s and Bessel’s interpolation formulae, Numerical differentiation.
Numerical integration: Newton-Cotes quadrature formula, Trapezoidal formula, Simpson’s 1/3rd and 3/8th formulae, Gaussian integration.
Inverse Interpolation, Numerical solution of algebraic and transcendental equations: Bisection method, Regula-falsi method, Method of iteration and Newton Raphson’s Method, Newton’s iterative formula for obtaining square and inverse square root.
Solution of a system of linear equations: Direct method (Gauss elimination method, LU-decomposition method), Iterative methods (Jacobi and Gauss Seidal method, SOR method), Theorems based on iterative methods, Solutions of first order ordinary differential equations: Picard’s method, Euler’s method, Runge-Kutta method.