Scribd
Upload
30 views4 pages

Syllabus Template MSc-IMCA

This document outlines the course objectives, content, and outcomes for a Numerical Analysis course. The course covers topics like root finding methods, interpolation, numerical integration, solving systems of linear equations, and numerical solutions to differential equations.

Uploaded by

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

Syllabus Template MSc-IMCA

This document outlines the course objectives, content, and outcomes for a Numerical Analysis course. The course covers topics like root finding methods, interpolation, numerical integration, solving systems of linear equations, and numerical solutions to differential equations.

Uploaded by

Shriya Chalke
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Note: Do not change format. (e.g. do not add table, numbering etc.

Sub. Code: IME-01 Subject Name: Numerical Analysis


[2T + 2P Credits] (Theory)

Course Objectives:
1. Develop a comprehensive understanding of key numerical methods like root finding,
interpolation, numerical integration, and solving differential equations, enabling effective
problem-solving in diverse mathematical contexts.
2. Acquire skills to analyze, quantify, and control errors in numerical methods for precise
computational solutions.
3. Examine root-finding methods (e.g., bisection, Newton-Raphson, secant), understanding
their convergence properties and practical applicability.
4. Study interpolation (e.g., Lagrange, Newton) and approximation methods for functions,
emphasizing practical applications.
5. Learn techniques for solving linear systems, covering direct methods (e.g., Gaussian
elimination) and iterative methods (e.g., Jacobi, Gauss-Seidel).
6. Comprehend and apply numerical integration methods (e.g., Trapezoidal rule, Simpson's
rule) for approximating definite integrals, analyzing accuracy, and assessing convergence
properties.

Course Outcomes:
CO1: Apply various numerical methods to solve mathematical problems with an
emphasis on accuracy and efficiency.
CO2: Apply Numerical methods to real world problems in science and technology,
recognizing limitations and making well-informed choices about its applications.
CO3: Assess numerical methods for specific problems, considering efficiency,
accuracy and computational cost.
CO4: Solve Systems of linear equations using both direct methods and Iterative
methods.
CO5: Apply numerical integration methods to approximate definite integrals with an
understanding of their accuracy and convergence properties.
CO6: Apply interpolation techniques and approximation methods to different
functions.

Course Content
Unit 1. Iterative solutions of Nonlinear Equations [5 Hours]
1.1 Regula Falsi Method
1.2 Newton Raphson Method
1.3 Acceleration of convergence
1.4 Newton’s Method for two nonlinear equations

Unit 2. Interpolation [6 Hours]


2.1 Difference Operators
2.2 Fundamental Theorem of Difference Calculus
2.3 Newton’s Forward Interpolation Formula
2.4 Newton’s Backward Interpolation Formula
2.5 The Lagrange’s Interpolation Formula
2.6 Divided Difference Interpolation Formula

Unit 3. Numerical Differentiation and Integration [7 Hours]


3.1 Numerical Differentiation
3.2 Forward Difference Quotient
3.3 Central Difference Quotient
3.4 General Quadrature Formula
3.5 Trapezoidal Rule
3.6 Simpson’s 1/3rd rule
3.7 Simpson’s 3/8th rule

Unit 4. System of Linear Equations [4 Hours]


4.1 Gauss elimination with partial pivoting
4.2 Gauss Jordan Elimination Method
4.3 Error analysis
4.4 Matrix Factorization Methods
4.5 Iterative Techniques
4.6 Gauss – Seidel Iteration

Unit 5. Numerical Solutions of Ordinary Differential Equations [4 Hours]


5.1 Taylor Series Method
5.2 Euler’s Method
5.3 Modified Euler’s Method
5.4 Runge-Kutta Methods
5.5 Runge-Kutta methods for system of equations.
5.6 Predictor – Corrector Methods

Unit 6. The Eigen value problem [4 Hours]


6.1 Power Method
6.2 Eigen value of symmetric matrices
6.3 Jacobi method

Text Book:
1. H. C. Saxena; Finite Differences and Numerical Analysis, S. Chand and
Company.
2. A textbook of Computer Based Numerical and Statistical Techniques, By A.
K. Jaiswal and Anju Khandelwal. New Age International Publishers.

Reference Books:
1. K.E.Atkinson; AN Introduction to Numerical Analysis, Wiley
Publications.
2. S. S. Sastry; Introductory Methods of Numerical Analysis, 3rd edition,
Prentice Hall of India, 1999

Sub. Code: Subject Name: Numerical Analysis Practical [2P Credits]


Course Objectives:
1.
2.
3.
4.
5.
6.

Course Outcomes:
CO1:
CO2:
CO3:
CO4:
CO5:
CO6:
List of Practical’s:

Practical 1: Practical on 1.1 and 1.2


Practical 2: Practical on 1.3 and 1.4
Practical 3: Practical on 2.1, 2.2
Practical 4: Practical on 2.3, 2.4
Practical 5: Practical on 2.5, 2.5
Practical 6: Practical on 3.1, 3.2
Practical 7: Practical on 3.3, 3.5
Practical 8: Practical on 3.6, 3.7
Practical 9: Practical on 4.1, 4.2, 4.3
Practical 10: Practical on 4.4, 4.5, 4.6
Practical 11: Practical on 5.1, 5.2
Practical 12: Practical on 5.3, 5.4
Practical 13: Practical on 5.5, 5.6
Practical 14: Practical on 6.1, 6.2, 6.3

You might also like