ME-365 Numerical Methods for Engineers (3+0) Spring-2021

Electrical Engineering Department U.E.T., Lahore

(NWL Campus
Session-2019

Course Objectives
ME 365 is a required course for the BSME program, and it is typically taken in the
third year. The primary goal is to provide Electrical engineering majors with a basic
knowledge of numerical methods including: root-finding, elementary numerical linear
algebra, solving systems of linear equations, curve fitting, and numerical solution to
ordinary differential equations.
MATLAB is the software environment used for implementation and application of
these numerical methods.
The numerical techniques learned in this course enable students to work with
mathematical models of technology and systems. Homework and projects in other courses
in the BSME curriculum require the mathematical and numerical skills obtained in ME 365.

Prerequisites
MA 101, Applied Mathematics I
MA 201, Applied Mathematics II
MA 202, Applied Mathematics III

Instructor
Muhammad Zeeshan Ashraf, Department of Mathematics, U.E.T. Lahore(NWL)
03314672984 [email protected]

Required Textbooks
 “Numerical Methods for Engineers” by Steven Chapra & Raymond Canale, McGraw
Hill, 7th Edition.
 “MATLAB An Introduction with Applications” by Amos Gilat, Wiley, 5th Edition.

Additional References
 “Applied Numerical Methods with MATLAB for Engineers and Scientists” by Steven
Chapra, McGraw Hill, 3rd Edition.
 “Numerical Methods Using MATLAB” John H. Mathews, Pearson Education, 4th Ed.
 “An Engineer’s Guide to MATLAB” by Edward B. Magrab, Prentice Hall, 3rd Edition.

1
Course Learning Objectives
The Learning Objectives are skills that you should obtain by the end of class. If you
can do all of the following activities very well, then you will likely get an A+ grade.
 The ability to write programs in Matlab that involve loops, logical block constructs
(if. . . else), plotting, and simple _le input/output. The ability to write programs that
evaluate and plot analytical functions. The ability to translate numerical algorithms
to correct Matlab programs.
 The ability to write Matlab programs to evaluate a truncated infinite series. The
ability to distinguish between the effects of truncation error and round off error in
evaluating a finite number of terms in an infinite series.
 The ability to define machine precision, underflow limit, and overflow limit and
identify the built-in Matlab variables for these concepts. The ability to use an
understanding of machine precision and round off errors to write Matlab code for
correctly testing convergence of iterative sequences. The ability to read and
interpret expert Matlab code (such as that found in the built-in toolbox, or other
computational libraries) that uses convergence tests involving machine precision.
 The ability to transform an engineering equation involving one unknown into the
canonical root-finding form: f(x) = 0. The ability to perform manual iterations of the
bisection method, Newton's method, and the secant method. The ability to apply
Matlab programs for finding the zeros of a function of one variable.
 The ability to manually perform addition, subtraction, and multiplication operations
on vectors and matrices. The ability to manually compute vector norms. The ability
to use all of these linear algebra operations in Matlab programs.
 The ability to set up and solve linear systems of equations. The ability to manually
perform Gaussian elimination and backward substitution on small systems. The
ability to use Matlab's backslash operator to correctly compute the solution to a
system of linear equations. The ability to interpret the condition number of
coefficient matrix for a linear system of equations. The ability to compute and
interpret the residual of a linear system of equations.
 The ability to use Matlab programs to perform curve fits of data to polynomials and
linear combinations of arbitrary functions. The ability to use a residual plot from a
curve fit as an indicator of whether a better curve fit might be obtainable.
 The ability to manually apply Euler's method, Heun's method, and the fourth order
Runge-Kutta method to advance a single ordinary differential equation for one or
two steps of the independent variable. The ability to use Matlab programs to obtain
numerical solutions to ordinary differential equations.

2
Course Learning Outcomes
On successful completion of this module, students will (be able to):
a) understand the need for numerical solutions to engineering problems
b) understand how numerical methods incur errors
c) use Matlab and Excel to code basic solutions to Engineering problems
d) perform basic statistical analysis
e) use the Taylor Series as a basis for error estimation
f) find numerical solutions to systems of equations
g) perform basic optimization
h) program curve fitting methods
i) perform numerical integration and differentiation
j) find numerical solutions to differential equations
k) apply the finite element method to basic engineering problems

3
 Lecture
Schedule
See Time Table Semester 4TH
Credit
Three Pre-Requisite Basic Calculus
Hours
Instructor Muhammad Zeesshan Ashraf Contact
[email protected]
03314672984
Office Maths. Dept. Contact Hours During Break,
Any Day
Approximation and round off errors, truncation errors and Taylor series. Roots of Equations:
bracketing methods, open methods, roots of polynomials. Difference Tables. Linear algebraic
Course
equations: Gauss elimination, matrix inversion, Gauss-Seidel method. Curve fitting and
Detail
interpolation. System of nonlinear equations. Numerical differentiation and Integration.
Ordinary & Partial Differential Equations (ODEs & PDEs).
Course Objectives of the course are to make the student understand various Numerical Techniques
Objective with applications to Engineering Problems.
Upon completion of this course, student will:
 Be able to implement the Numerical Techniques on various Engineering Problems.
Expected  Be able to solve complex physical problems involving Integration and Differentiation
Outcome using Numerical Techniques in a much easier way.
 Be able to model and solve problems involving Differential Equations which are
unsolved analytically.
REQUIRED:
Text Numerical Methods for Engineers, S.C. Chapra & R.P. Canale, McGraw-Hill 6th Ed.
Books OPTIONAL:
Numerical Methods Using MATLAB, John H. Mathews, Pearson Education, 4th Ed.
 Class participation/Attendance/Quizzes: 30%
Grading
 Mid Semester Exam.: 30%
Policy
 End Semester Exam.: 40%
LECTURE PLAN
Readings
Lectures Topics
(Chapra)
2
Errors: Approximations and round off errors, truncation errors and Taylor series Chapter 3
Weeks*
3
Roots of Equations: Bracketing methods, Open methods, Roots of the poly. Chapter 2
Weeks*
3
Difference Tables and their examples
Weeks*
4 Linear Algebraic Eqs.: Gauss elimination, Matrix inversion, Gauss-Seidel
Chapter 3
Weeks* Meth.
MID TERM EXAM*
3
Polynomial Approximation Chapter 4
Weeks*
4
Curve fitting and Interpolation Chapter 4 & 5
Weeks*
4Weeks* Numerical Integration and Numerical Differentiation Chapter 6 & 7
4 Chapter 9 &
Ordinary and Partial Differential Equations
Weeks* 10
END TERM EXAM*
*Tentative
4
 WEEK-WISE WORK PLAN

WEEK LECTURES CONTENTS TO BE COVERED REFERENC

E BOOKS
Lecture-1 Chapra
(mention other
Hour(s): 1 Introduction to Numerical Analysis, Outline of the
references if
FIRST WEEK

course, objective and outcomes.

use different)
Date

Lecture-2 Chapter 3
(Chapra)
Hour(s):2 Errors: Approximations and round off errors, in
Chapter 1
additions and subtraction.
(NM by Saeed
Date

Akhtar)

Lecture-3 Error approximation in multiplication and Chapter 3

division. (Chapra)
Hour(s):1
SECOND WEEK

Chapter 1
(NM by Saeed
Date

Akhtar)

Lecture-4 Error approximation in division and functions. Chapter 3

Truncation errors and Taylor series and Mclaurin (Chapra)
Hour(s):2 series. Chapter 1
(NM by Saeed
Date

Akhtar)

Lecture-5 Introduction to non-linear equations and their Chapter 2

solutions. Bisection method to solve non linear
Hour(s):1 equation.
THIRD WEEK

Date

Lecture-6 Method of false position to find the root of non Chapter 2

linear equations
Hour(s):2
Date

Lecture-7 Secant method to find the root of non linear Chapter 2

WE
UR
TH

EK
FO

equations with geometric representation.

Hour(s):1

5
 Date
Lecture-8 Newton Raphson method for the solution of non- Chapter 2
linear equations with geometric representation.
Hour(s):2 End of topic with discussion on non linear
approximation methods.
Date

Lecture-9 Introduction to finite differences their Chapter 5 of

applications and importance. Finite differences NM by V. N.
Hour(s):1 tables. Vendamurthy
FIFTH WEEK

Date

Lecture-10 Forward difference operator and their table. Chapter 5 of

Approximation of function using forward NM by V. N.
Hour(s):2 difference table. Vendamurthy
Date

Lecture-11 Backward difference operator and construction of Chapter 5 of

table. NM by V. N.
Hour(s):1 Vendamurthy
SIXTH WEEK

Date

Lecture-12 Central difference, average difference and shift Chapter 5 of

operators construction of tables and the relation NM by V. N.
Hour(s):2 between all operators discuss in previous lectures. Vendamurthy
Date

Lecture-13 Introduction to system of linear Algebraic Chapter 3

equations, geometric representation of solution
SEVENTH WEEK

Hour(s):1 for the system of linear equations.

Date

Lecture-14 Guass elimination method using matrix form. Chapter 3

Matrix inversion method.
Hour(s):2
Date

6
 Lecture-15 Guass Seidal iterative method for the system of Chapter 3
linear equations.
Hour(s):1
EIGHTH WEEK

Date

Lecture-16 Jacobi iterative method for the solution of system Chapter 3

of linear equation.
Hour(s):2 Conclusion of teaching.
Date

Examination
MID TERM
NINTH
WEEK

Lecture-17 Introduction to polynomial approximation Chapter 4

methods.
TENTH WEEK

Hour(s):1
Date

Lecture-18 Polynomial approximation for equal interval Chapter 4

using forward differences and backward
Hour(s):2 differences formula.
Date

Lecture-19 Polynomial approximation for unequal Chapter 4

subinterval, Newton divided difference.
ELEVENTH WEEK

Hour(s):1
Date

Lecture-20 Lagrange’s method for polynomial Chapter 4

approximation.
Hour(s):2
Date

Introduction to curve fitting and polynomial Chapter 4 & 5

ELV
ETH

Lecture-21
WE
TW

EK

approximation.
Hour(s):1

7
 Date
Lecture-22 Linear quadratic fitting of polynomial. Chapter 4 & 5

Hour(s):2
Date

Least square method Chapter 4 & 5

THIRTEENTH WEEK

Lecture-23
Hour(s):1
Date

Lecture-24 Quadratic polynomial fitting using least square Chapter 4 & 5

method.
Hour(s):2
Date

Lecture-25 Introduction to Numerical differentiation and their Chapter 7

advantages.
FOURTEENTH

Hour(s):1
Date
WEEK

Lecture-26 Numerical differentiation using Newton’s forward Chapter 7

and backward differences.
Hour(s):2
Date

Lecture-27 Introduction to Numerical integration. General Chapter 6

FIFTEENTH WEEK

quadrature formula and Trapezoidal rule for

Hour(s):1 integration.
Date

Lecture-28 Simpson’s 1/3 and 3/8 Rules for numerical Chapter 6

integration.
Hour(s):2
Date

Chapter 9 &10
TEE
SIX

Lecture-29
WE
NT

EK
H

Hour(s):1

8
 Introduction to numerical solution of differential

Date
equations and their applications. Power series
solution for Ist order differential equations.
Lecture-30 Euler’s method, Improved Euler’s method for Chapter 9 &10
differential equations
Hour(s):2
at
D

Lecture-31 Modified Euler method. Rung-e-Kutta method of Chapter 9 &10

first order.
SEVENTEENTH

Hour(s):1
WEEK
D
at
e

Rung-e-Kutta method of higher order. Chapter 9 &10

Lecture-32 Conclusion of Teaching.

Hour(s):2
at
D

e
EIGHTEENT

FINAL TERM EXAMINATION

H WEEK