Course Title: Applied Numerical Methods
Course code:
Government Engineering College
COURSE CURRICULUM
Course Title: Applied Numerical Methods
(Code: ______________)
Semester: III
Degree Programs in which this
course is offered
Pre-requisite Course
B. E . Semester III
Co-requisite Course
Type of Course
Course Difficulty level
Course offered in
Academic year
1.
Algebra,Trigonometry and Basic
Calculus, ODE, Basic Software
skill
Core
A
2014-15
TEACHING AND EXAMINATION SCHEME
Teaching Scheme
Total Credits
(In Hours)
T
P
(L+T+P)
C
Examination Scheme
Theory Marks
Tutorial
Submission Marks
ESE
ESE
MSE
PA
Activity
70
30
25
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical;
Semester Examination; PA - Progressive Assessment
2.
Total
Marks
150
25
C - Credit; ESE -End
COURSE OVERVIEW
This course will provide students with an introduction to numerical methods and one of software like
Scilab or Matlab or else. Topics covered throughout the course will include: errors, condition numbers
and roots of equations; direct and iterative methods for linear systems; interpolation, numerical
differentiation and integration. The specific objectives of the course are:
1. To introduce and develop the main approaches and techniques that constitutes the basis of numerical
techniques for engineers.
2. To familiarize students with the numerical implementation of these techniques and numerical
schemes, so as to provide them with the means to write their own codes and software, and so acquire
the knowledge necessary for the skillful utilization of software.
COURSE OBJECTIVES
By the end of this course, a student will be able to find:
Roots of a general function and zeros of a polynomial by calculation as well as by
software,
Solution of Linear System,
Course Title: Applied Numerical Methods
Course code:
Interpolation,
Numerical differentiation and integration.
The course is designed in such a way that it can be covered comprehensively in a semester course of 36
hours direct teaching and 24 hours tutorialsin a tutorial batch of 20 students with activity based learning.
3.
COURSE OUTCOMES
Upon successful completion students should be able to:
determine the roots of general functions and zeros of polynomial
determine the solution of linear system
determine the interpolation
determine the numerical differentiation
determine the numerical integration
COURSE DETAILS
Unit - 1
Learning
Outcomes
Fundamentals
During this unit student will:
(Student
Learning
Outcomes)
Understand the useful results from calculus and linear Algebra
Evaluate error, its convergence and improvement for better result.
Use of some special types of Matrices
Develop the algorithm for Matrices
Topics and
Sub-topics
Useful results from Calculus & Linear Algebra
Error, Convergence & Improvement For better Results.
Algorithms For Matrices:
Some Special Types Of Matrices & Matrix algebra
Unit - 2
Learning
Outcomes
(Student
Learning
Outcomes)
Function of One Variable
During this unit student will:
Able to understand the Bisection Method, Regular Falsi and Secant Method.
Apply theses to find the roots and zeros of Polynomial.
Able to understand Newtons Method, Mullers Method.
Apply to solve the polynomial.
Develop an algorithm for the above said method.
Course Title: Applied Numerical Methods
Topics and
Sub-topics
Unit - 3
Course code:
Bisection Method
RegulaFalsi& Secant Method
Newtons Method
Mullers Method
Minimization:Goldan-Section
Search,Brents Method
Algorithms For roots and Zeros Of Polynomials.
Solving Systems of simultaneous Linear Equations
During this unit student will:
Learning
Outcomes
(Student
Learning
Outcomes)
Topics and
Sub-topics
Unit - 4
Able to solve system of simultaneous linear equation.
Apply the Method of Gauss Elimination, Gauss-Jordan Elimination
Able to find the Inverse of the matrix.
Apply Gauss- Thomas elimination(Thomas algorithm)
Evaluate the solution by Jacobi and Seidal Method
Develop an algorithm for solution of system of simultaneous linear equation
Gauss Elimination
Gauss-Jordan Elimination
Inverse of Matrix
Gauss-Thomas Elimination (Thomas algorithm)
Jacobi Method
Seidal Method
Algorithms for Solving Systems of simultaneous Linear Equations
Interpolation
During this unit student will:
Learning
Outcomes
(Student
Learning
Outcomes)
Able to find the polynomial by Newtons Forward & Backward
Interpolation, Lagranges Interpolation, Newtons Divided Difference
Method
Express of Piecewise Interpolation: Linear and Quadratic, Cubic
Hermite Interpolation
Develop the algorithm for Interpolation
Topics and
Sub-topics
Unit - 5
Polynomial Interpolation:
Newtons Forward & Backward Interpolation, Lagranges
Interpolation, Newtons Divided Difference Method
Hermite Interpolation
Piecewise Interpolation: Linear and Quadratic, Cubic Hermite
Interpolation
Numerical Differentiation and Integration
Course Title: Applied Numerical Methods
Course code:
During this unit student will:
Express First and Higher order derivatives and partial derivatives by finite
difference operator.
Able to solve Differentiation and Integration by numerical methods.
Able to apply Trapezoidal, Simpsons rule for numerical integration
Discuss the Richardson and Extrapolation formula.
Express the Newton Cotes and Gaussian quadrature formulas.
Develop the algorithm for numerical solution
Learning
Outcomes
(Student
Learning
Outcomes)
Topics and
Sub-topics
First & Higher order ordinary Derivatives and Partial Derivatives
Using Finite Difference Operator
Richardson Extrapolation
Trapezoidal, Simpsons Rules
Newton-Cotes Open Formulas
Extrapolation Methods
Guassian Qudrature
Algorithms For Numerical Integration & Differentiation
4. COURSE TEACHING AND LEARNING ACTIVITIES
Lectures
(hrs)
In/out of
Class
Interactive Laboratory
Case
Tutorial
(hrs)
Discussion
(hrs)
(hrs)
In/Out
36
24
Field
Projects
Web
Oth
Trip
(hrs)
Based
ers
Learning
(hrs)
(hrs)
-
(hrs)
5. SUGGESTED LESSION PLAN (THEORY)
Unit
No.
1
Topics
1
2
3
4
5
6
7
8
9
10
Foundation
Useful results from Calculus and Linear Algebra
Error, Convergence and improvement for better result
Algorithm and Programming basics
Functions of one variable
Bisection Method
Secant Type methods : Regula Falsi, Secant Method
Newtons Method
Mullers Method
Minimization: Golden Section Search, Brents Method
Roots of a general function and zeros of a polynomial in
software
Solution of Linear Systems
Gaussian Elimination
4
Teaching
Hours
4
Course Title: Applied Numerical Methods
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
Course code:
Gauss Jordan Elimination and Inverse of Matrix
Gauss Thomas method (Thomas Algorithm)
Jacobi Method
Gauss Seidal Method
Software functions for linear systems
Interpolation
Polynomial Interpolation : Lagrange form, Newton form
Hermite Interpolation
Piecewise Linear Interpolation
Piecewise Quadratic Interpolation
Piecewise Cubic Hermite Interpolation
Cubic Spline Interpolation and software functions
Numerical Differentiation and Integration
First order derivatives, Higher order ordinary Derivatives
and Partial Derivatives Using Finite Difference Operator
Richardson Extrapolation
Trapezoid Rule
Simpsons Rule
Newton Cotes open formulas
Extrapolation method
Gaussian Quadrature
Software functions for differentiation and integration
11
6. ASSESSMENT SCHEME (Including Rationale)
A break up of Internal assessment and Final examination should be provided
It should be clearly stated that what is required to pass the course and also the requirement for
progression
A breakdown of each of the component with their weight and it will be due should be clearly
stated
Internal Break up
Task
Class attendance & Participation at
the time of End Semester Activity
Time
Description
Minimum attendance
as per the norms
End Semester Activity: Group
Projects, Assignments, Presentation
or Viva
Presence
in
percentage
100 91
10 - 08
90 81
07 - 05
80 75
04 - 01
Weight
10/50 Marks
Marks
15/50 Marks
Course Title: Applied Numerical Methods
Course code:
Progressive Assessment Test
10 Min.
weekly
Weekly in one of the
lecture/tutorial 10 min
test can be arranged.
Mid semester Exam
1.5 Hour
30 Marks
Final Exams
3 Hours
70 Marks
25/50 Marks
Final Examination Plan
Unit
Unit Title
Distribution of Theory Marks
Cognitive level
(Blooms taxonomy)
U An Ap
E
Sy
Total
Marks
I
II
III
IV
V
Foundation
Functions of one variable
Solution of Linear Systems
Interpolation
Numerical Differentiation and
Integration
Total
Legends: R = Remember; U= Understand; Ap= Apply; An = Analysis; E = Evaluation, Sy = Synthesis, as per
(Blooms revised taxonomy)
Note: Tutorial must be prepared by Faculty.
7. SUGGESTED LIST OF STUDENT ACTIVITIES
Learn MATLAB / Scilab commands.
8. SUGGESTED LEARNING RESOURCES
A. List of Books:
S.
Title of Books
No.
1
Applied Numerical
Analysis Using
MATLAB
Applied Numerical
Methods Using
MATLAB
Numerical Analysis
Author
Publication
Laurence V. Fausett
Pearson
Won Young Yang,
Wenwu Cao, Tae-Sang
Chung, John Morris
Richard
John-Wiley and Sons
Cengage Publication
Course Title: Applied Numerical Methods
S.
Title of Books
No.
4
Numerical Methods For
5
Course code:
Author
Publication
Steven Chapra, Raymond
Tata McGraw Hill
Engineers
Canale
Publication
SCILAB is open source software and related open source contents are
available on Internet.
B.
Learning Websites
NPTEL Computational Techniques - Video courseby Prof. Dr. Niket [Link], IIT Madras
Link: [Link]
C.
List of Software (preferably open source)
(1)
D.
MATLAB
(2)
Scilab
List of Major Equipment with broad specifications
Computer Systems
