THE UNIVERSITY OF LAHORE

Course Outline
MAT-06306 NUMERICAL COMPUTING
Bachelor of Science in Computer Science
Spring 2022 Session
Effective from: February 07, 2022

Credit Hours 3
Pre-requisite(s) Calculus & Analytical Geometry
Post-requisite None
Course Type Core for BSCS
Course Duration 16 Weeks
Weekly tuition pattern 2 Lectures (90 Minutes each),
Course Structure Presentation by instructors, group, quizzes, assignments
The course will be delivered mostly in a classroom
Course Style environment.
Web Link slate.uol.edu.pk
Usman Javed
Instructor usman.javed@cs.uol.edu.pk
Course Description
Numerical Computing is an important branch in Computational Mathematics.
It aims at numerically solving all kinds of mathematical problems which
arise from practical applications and can be modeled by different
mathematical equations or inequalities, for example, linear or nonlinear
differential equations and integral equations. This Course is a rich
blending of algorithms, mathematics, and computing that plays a pivotal
role in our world. In many ways the study of numerical analysis provides
a training ground for analytically thinking in the area of computational
algorithms.

Numerical computation is about ‘proper way’ of doing numerical (as

opposed to symbolic) computations in scientific and technical arenas
using a digital machine. The course includes the study of numerical
solutions of linear and non-linear algebraic equations, numerical
interpolation, the numerical solution of ordinary differential
equations, numerical differentiation and integration.

Objectives

1. Derive appropriate numerical methods to solve algebraic and

transcendental equations.
2. Develop appropriate numerical methods to solve a differential
equation.
3. Derive appropriate numerical methods to evaluate a derivative at a
value.
4. Apply appropriate numerical methods to solve a linear system of
equations.
5. Perform an error analysis for various numerical methods.
6. Prove results for various numerical root finding methods.
7. Derive appropriate numerical methods to calculate a definite integral.

Outcomes
After successfully completing the course, students will have a good
understanding of the following topics and their applications:
1. Describe difficulties that can arise because computers usually use
finite precision.
2. Grasp the numerical techniques and should be able to use a variety of
methods in solving real-life, practical, technical, and theoretical
problems which cannot be solved by other methods.
3. Apply the Bisection, Regula Falsi, Newton and Iteration methods to
solve a non-linear equation.
4. Apply the different method to solve linear Equations such as direct
and iterative methods.
5. Construct Lagrange and Newton forward difference interpolation
polynomials for a given set of data.
6. Apply Trapezoidal and Simpson’s rules to find the approximate value
of an integral.
7. Describe the basic concepts behind the R-K method and apply specific
R-K methods in given problems.

In addition, students will become familiar with MATLAB-

oriented numeric programming environment.
Course Structure

• Presentation by lecturer
• Class Activities and Home assignments
• Quizzes
Text
Numerical Analysis by Richard L. Burden and J. Douglas Faires, 9th
edition, Brookes Cole.

Other Resources

I. Applied Numerical Analysis using MATLAB by Laurene V. Fausett, 2nd

edition

II. Numerical Computing with MATLAB by Cleve B. Moler 2nd Edition

Assessment Criteria

No. Assessment Percentage

1. Final Term Exam 50%

2. Mid Term Exam 30%

3. Quizzes 10%

4. Assignments 10%

Total 100%
Course Outline
The instructors are supposed to complete the following topics/sub-topics
before the mid/final term examination as prescribed in the course outline
below:
Week Lectures Topics/Sub-Topics
1 1 REVIEW OF CALCULUS:
Mean value theorem, Rolle’s theorem
ERRORS:
Errors and their computations
Absolute, relative and percentage errors
A general error formula
Error in a series approximation
2 SOLUTIONS OF EQUATIONS IN ONE VARIABLE:
Bisection method
2 3 Method of false position (Regula-falsi method)
4 Newton-Raphson method
3 5 Secant method
6 Fixed-point iteration method
4 7 ITERATIVE METHODS FOR LINEAR SYSTEMS:
Jacobi method: Example
8 General form of Jacobi method and its MATLAB CODE
5 9 Gauss-Seidel technique: Example
10 General form of Gauss-Seidel method and its MATLAB
CODE
6 11 DIRECT METHODS FOR LINEAR SYSTEMS:
Doolittle method
Crout’s method
12 General form of Doolittle algorithm
7 13 General form of Crout’s algorithm
14 Cholesky method, General form of Cholesky’s
algorithm
8 15 LDLt method, General form of LDLt algorithm
16 Doolittle and Crout’s algorithms for Tridiagonal
systems
9 MID-TERM EXAMINATION
10 17 INTERPOLATION AND POLYNOMIAL APPROXIMATION:
Lagrange interpolating polynomials.
General algorithm of Lagrange interpolation and its
MATLAB code.
Lagrange inverse interpolation.
18 Data approximation and Neville’s method
Neville’s iterated interpolation algorithm and its
MATLAB code.
11 19 Divided differences and divided difference matrix.
20 Designing general algorithm of divided difference
matrix and interpolation formula. MATLAB code for
algorithm.
12 21 Forward difference matrix.
Forward difference interpolation formula.
 Algorithm for Forward difference interpolation and
its MATLAB code.
22 Backward difference matrix.
Backward difference interpolation formula.
Algorithm for backward difference interpolation and
its MATLAB code.
13 23 NUMERICAL INTEGRATION:
Trapezoidal rule
24 Simpson’s 1/3 rule
Simpson’s 3/8 rule
14 25 NUMERICAL SOLUTIONS TO ORDINARY DIFFERENTIAL
EQUATIONS:
Euler’s method
26 R-K algorithm of 2nd order:
Modified Euler’s method.
Mid-point method.
15 27 R-K algorithm of 3rd order
28 R-K algorithm of 4th order
16 FINAL TERM EXAMINATION

Attendance Requirements
Students are encouraged and expected to attend all lectures or any
other activity related to the course. Moreover, students are
responsible for their attendance and they must meet the minimum
attendance requirement policy of the Department for appearing in
final term exam.

General Information
• Students are required to be familiar with the University’s code of
conduct, and to abide by its terms and conditions.
• Students must provide proper references to acknowledge other’s
works/ideas.
• In order to avoid plagiarism, students are required to follow the
guidelines provided by the Department/University.
• Students may use any sources (acknowledged of course) other than
the assignments of fellow students.

Approval

Designed by, Approved by,

Usman Javed