COMSATS Institute of Information Technology, Attock Campus
URL: www.ciit-attock.edu.pk
Contact: 92 (057) 931633-121
E-mail:
[email protected]Detailed Course Outline
Numerical Computations (MTH-375)
BS(EE)-V, BS(CE)-V & BS(CS)-VI
Fall 2016
Introduction
:
Numerical Computation is very useful in all fields of sciences it is the
study of algorithm that use numerical approximation for the problems of
mathematical analysis.
Objectiv
es:
Main objectives of this course
are to
Introduce the Numerical Computations.
Introduce the Error Analysis.
Enable the students to solve non-Linear equations and system of
Linear Equations.
Introduce the interpolation and different methods of
interpolation.
Enable the students to numerical differention and integration.
Enable the student to find the numerical solution of ordinary
differential equations.
Course Outcomes:
After completing this course, students will be:
Able to learn the concept of root finding of non-linear equations.
Able to solve the systems of linear equations using direct and indirect methods.
To compute the values of functions using interpolation.
To evaluate integration and differentiation numerically.
To solve the ordinary differential equation numerically.
Teaching Strategy:
The course follows the schedule as set out in the table. The table
COMSATS Institute of Information Technology, Attock Campus
presents complete details of teaching and lecture wise topics, any
practical conduction requirements, quizzes and assignments. Quizzes
will also be conducted as proposed as planned.
Week/Lect
ure
Lectu
Wee
k
1
Wee
k
2
Wee
k
3
Wee
k
Course Content
re
1
Introduction to Numerical Computation
and some preliminaries
Lectu
re
2
Error Analysis and types of errors, Root
Lectu
re
1
Solution of Non-Linear equations
Bisection Method
Lectu
re
2
Bisection Method and Regula-Faulsi
Method
finding of Non Linear Equations.
Lectu
re
1
Fixed Point Method and Secant Method
Lectu
re
2
Derivation of Newtons Method and its
Examples
Lectu
re
1
Convergence Analysis of Newtons
Method
Wee
k
5
Book,Q/A
Lectu
re
2
Direct Methods for solving system of
linear equations, Gauss elimination and
Jordan Methods
Lectu
re
1
Gauss elimination and Jordan Methods
and Examples related with these
methods
Lectu
re
2
LU-Decomposition Methods
Crouts reduction and its example
Quiz and
Assignment of
above topics
COMSATS Institute of Information Technology, Attock Campus
Wee
k
6
Wee
k
Lectu
re
1
Lectu
re
2
Lectu
re
1
Wee
k
8
Wee
k
9
Wee
k
10
Wee
k
11
Wee
k
12
Lectu
re
2
Lectu
re
1
Lectu
re
2
Do-little and Cholesky methods and its
examples
Iterative techniques to solve the
system of linear equations, Gauss
Jacobi method and examples Gauss
Siedel Method and examples
Eigen Value Problem
Power Method and its examples
Introduction to Interpolation
Difference operators and its examples
Newtons forward and Backward
difference Interpolation Formulas
Lectu
re
2
Examples using above two formulas
Lectu
re
1
Langrange Interpolating Polynomial and
Introduction to Divided Differences
Lectu
re
1
Lectu
re
2
Lectu
re
1
Lectu
re
2
Quiz And
Assignment Of
Previous
Chapter.
Construction of Differences Table and
examples
Lectu
re
1
Lectu
re
2
Quiz and
Assignment of
above topics.
Quiz from
previous
chapter
& Assignment
Newtons Divide Differences
Interpolation Formula and its examples.
Cubic Spline Interpolation
Numerical Differentiation using forward
and backward difference formula
Numerical Differentiation examples
Numerical Integration
Newton-cotes Integration Formulae
Trapezoidal Rule
Quiz from
previous
chapter
& Assignment
COMSATS Institute of Information Technology, Attock Campus
Wee
k
13
Wee
k
14
Lectu
re
1
Lectu
re
2
Lectu
re
1
Lectu
re
2
Wee
k
15
Lectu
re
1
Lectu
re
2
Simpsons Rule and examples
Introduction to Numerical Solution of
ODE
Taylors Series Method and application
Quiz from
previous
chapter
& Assignment
Euler and Modified Euler Methods and
exercise
Runge-Kutta Methods
Runge-Kutta Methods contd
Evaluation:
The quizzes and assignments will be conducted and will be based on
their practical quantitative research following the deadlines for
various stages. The 25% component of the total 100 Mark will be
evaluated using quizzes, assignments before the end of Week 13 of
the semester so as they have enough time for preparation for the
Terminal Examination which carries 50% marks. No deadline
relaxation of any type without a valid reason as defined in this regard
will be entertained. The complete table of evaluation is as:
Marks Distribution:
Marks obtained in 4-6 Quizzes
15%
Marks obtained in 4-6 Assignments/Project phases
10%
Total Q/A:
First Sessional
Second Sessional
15%
Total Sessional Marks:
Terminal Examination
Course Total Marks:
Minimum Passing Marks:
50%
25%
10%
25%
50%
100%
COMSATS Institute of Information Technology, Attock Campus
Reading & learning resources:
Numerical Methods for Scientist and Engineers by K. Sankara Rao.
Numerical Analysis by Richard L burden & J. Douglas Faires.
Course Instructor: Dr. Muhammad Shoaib
