Scribd
Upload
19 views2 pages

Numerical Analysis Course Syllabus 2020

The document outlines the M.Sc. course syllabus for Numerical Analysis (MSMA-110) at DTU, detailing its objectives, content structure, and practical applications using MATLAB. The course covers various numerical methods including fixed point iteration, matrix techniques, interpolation, and numerical integration, with a total of 42 contact hours. Suggested textbooks for further reading are also provided, along with a list of practical exercises to reinforce the theoretical concepts.

Uploaded by

Aditya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views2 pages

Numerical Analysis Course Syllabus 2020

The document outlines the M.Sc. course syllabus for Numerical Analysis (MSMA-110) at DTU, detailing its objectives, content structure, and practical applications using MATLAB. The course covers various numerical methods including fixed point iteration, matrix techniques, interpolation, and numerical integration, with a total of 42 contact hours. Suggested textbooks for further reading are also provided, along with a list of practical exercises to reinforce the theoretical concepts.

Uploaded by

Aditya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Applied Mathematics, DTU [Link].

Syllabi-2020

Subject Code: MSMA-110 Course Title: Numerical Analysis


Contact Hours: L-3 T-0 P-2
Examination : TH: Yes PR: No
Relative Weightage: CWS: 15 PRS: 25 MTE: 20 ETE: 40 PRE: 0
Credits: 4
Semester: EVEN
Subject Area: DCC
Pre-requisite: Some knowledge of calculus and linear algebra.
Objective: After the course, one should be able to solve
various real-life problems computationally.

Details of Course:

S. No. Contents Contact


Hours
1. Fixed point iteration, Bisection method, Newton Raphson method, secant & Regula 7
Falsi method, Convergence analysis, determination of Multiple roots, Newton Raphson
for simultaneous nonlinear equations.
2. Vector and Matrix norms, ill conditioned equations, Gauss elimination method, LU 8
decomposition, Jacobi & Gauss Seidel iterative methods and their convergence,
relaxation methods.
3. Jacobi method, Given’s method, Householder’s method, Eigenvalues and Eigenvectors 8
of tridiagonal matrix, power method.
4. Interpolation, Lagrange interpolation formula, Newton’s divided difference, Splines, 6
Least Square method.
5. Taylor’s series method, Difference operator, differentiation using interpolating 7
polynomials, Finite difference methods, Newton Cotes formulas, Simpson’s rule,
Gauss Quadrature, Richardson’s extrapolation.
6. extrapolation.
Euler’s method, Modified Euler method, Runge Kutta method, multistep methods. 6
Finite difference method, solution of nonlinear BVP.

Total 42

Suggested Books:

S. No. Name of Books/Authors/Publishers Year of


Publication/
Reprint
1. M. K. Jain & S. R. K. Iyengar, Numerical Methods for Scientific and 2005
Engineering Computation, New Age International Publishers.

2. R. S. Gupta, Elementary Numerical Analysis, Cambridge University Press 2015

3. Ascher U.M., A first course in numerical methods 2013

4. S.S. Rao, Applied numerical methods for engineers & Scientist, PHI 2001

20 | P a g e
Department of Applied Mathematics, DTU [Link]. Syllabi-2020

List of Practicals for Numerical Analysis Course using MatLab (MSMA-110 Numerical Analysis)

1. Newton Raphson’s method and its convergence


2. Comparison between convergence of various methods to find root of a nonlinear equation
3. Gauss Elimination and LU decomposition
4. Gauss Seidel and Gauss Jacobi
5. Finding eigen values using power method, Jacobi method
6. Lagrange and splines methods for interpolation
7. Newton cotes methods for numerical integration
8. Gauss Quadrature, Richardson’s extrapolation.
9. Euler’s method for IVP.
10. Runge Kutta method for IVP
11. Finite difference methods for solving BVP
12. Solving non-linear BVP

21 | P a g e

You might also like