Department of Basic Sciences

Course:
Numerical Methods
Instructor: Ishtiaq Ahmad (Msc. C.S, MSc C.E.)
Aims:
Numerical methods are now part of every syllabus for science and
engineering students. A scientist is expected to develop
mathematical models and then find solutions for real life systems.
The solutions can be analytical and numerical. When solving a
problem by analytical method is very difficult we turn to numerical
methods for help. These tools use computers and programming.
The target will be on learning how to develop analysis and write
computer programs to solve problems using numerical techniques
and computer. We will study and practice various numerical
techniques and learn how to implement methods in modern
computers using suitable programming languages.
Broad course contents:
We will cover a number of ideas and techniques useful for numerical
methods. In first part, we will study basic ideas about errors and
evaluation of formulae. Then in the second part we shall focus on
solution of non-linear algebraic equations, and roots finding. After
this, we will learn how simultaneous linear equations are solved using
numerical techniques. Here we will study Gaussian Elimination
techniques and Gauss-Jordan methods. In third part we shall focus
on how finite differences are calculated and introduction to
numerical differentiation and numerical integration will be done. In
last part we will study how ordinary differential equations are solved
by numerical methods. In this part, we will study Euler method,
predictor corrector methods, Runge Kutta methods. Then we will
study the numerical methods to find Eigen values and eigenvectors.
We will also briefly learn about simultaneous ODE and introduction
to various Optimization Techniques. Matlab will be used as tool for
the course.

Objectives:
After the completion of this course students should be able to solve
numerically majority of mathematical problems using MATLAB and
Simulink tool box. Following are the objectives for the course;
Getting acquainted with methods from Numerical Analysis.
Develop intuition for the reliability of Numerical Methods.
Gain experience in numerically solving a Problem.
Prerequisites:
The prerequisites for this course are basic knowledge of
programming, differential calculus, Mathematics and problem
solving. We will not be using very heavy mathematics. Students
should be ready to work hard and to learn new concepts used in
programming and numerical methods.
Books & Material:
1. Numerical Methods in Engineering with MATLAB by - Jaan
Kiusalaas
2. A first course in Numerical Analysis with C++ by Saeed Akhtar
Bhatti
3. Numerical methods for engineers and scientists by A.C. Bajpai,
I.M. Calus and J.A. Fairley, John Wiley & Sons, N.Y. (2002)
4. Numerical Analysis, By Burden & Faires, Fifth Edition.
5. Matlab Manual;
Class Group:
Class notes, handouts, etc., will be available at the class group
which is http://groups.yahoo.com/group/NM_EE08 . This will be updated
from time to time. It is students responsibility to see this folder daily
for any announcements about the course.
Assessment Criteria:
You will be evaluated in the course based on the following criteria.
Assignments (03)
10%
Quizzes
(03)
10%
Mid
20%
Project/attendance 20%
Final
50%
Note: Minor changes can be made in the above mentioned criteria
2

Course topics:
1. Basic Ideas , errors and evaluation of formulae;
2. Solution of non-linear algebraic equations
a. Newton-Raphson iteration form
b. Bisection method
c. Iterative method
d. Secant method, false position
e. Simultaneous nonlinear equation
3. Solution of linear algebraic equations
a. Direct and indirect Methods
b. Gaussian elimination
c. Gauss-Jordan elimination
d. Jacobi Method
e. Gauss Seidel iterative method
f. Successive Over Relaxation Method
4. Least square and curve fitting with examples
a. Linear regression
b. Nonlinear regression
5. Finite difference
a. Linear operators
b. forward difference
c. backward difference
d. central difference operations
6. Numerical Differentiation
7. Numerical Integration (Trapezium rule, Simpson rule and threeeighth rule )
8. First order ODEs
a. Euler method,
b. improved euler method, predicator-corrector methods,
c. Runge Kutta method;
9. Introduction to numerical solutions for Higher order ODEs.
10.
Eigen values and Eigen vectors