Adama Science and Technology University

1 School: SoEEC Department: EPCE

2 Course Category Major Mandatory
Course Name Computational Method
Course Code: EPCE2204
The course deals with the following major points: - Number system and
numerical error analysis, review of matrices, solution of linear equation,
3 Synopsis
solution of nonlinear equation, approximation and interpolation techniques,
and numerical differentiation and integrations.
4 Name(s) of 1. Tamiru G.([email protected])
Academic Staff: 2. Mati Oljira([email protected])
5 Semester and Year
Semester II Year: 2
offered:
6 Credit Hour: 3 (2hr Lecture, 3hr Laboratory)
7
Prerequisite: Math2101 and Fundamentals of Programming
8
Course Schedule Lec.(Wend. 2:00-3:50 & Fri. 8:00-9:50) & Lab (Mon & Thus. For sec 1, Tue & Fri. for sec 2)
9 Programme Outcomes (POs)
PO1 Engineering Knowledge
PO2 Problem Analysis
PO3 Design/development of solutions
PO4 Investigation
PO5 Modern tool usage
PO6 The engineer and society
PO7 Environment and sustainability
PO8 Ethics
PO9 Individual and teamwork
PO10 Communication
PO11 Project management and finance
PO12 Lifelong learning
10 Course Learning Outcome (CLO): At the end of the course the student will be able to: -
Discuss different types of error, Significant figures, and number representation &Storage
CLO1
in Computers
CLO2 Discuss basic concepts of matrices
Develop a program that will solve linear equations using direct, matrix, and iterative
CLO3
solution methods.
Identify and analyze different numerical methods for the determination of the roots of an
CLO4
equation and solve nonlinear equations.
Evaluate basic curve fitting using least square regression method and interpolation
CLO5
methods.
Analyze numerical solutions to solve differentiation, integration and ordinary differential
CLO6
equations.
11 Mapping of the course Learning Outcomes to the program Learning Outcomes, Teaching Methods
and Assessment:
Program Learning Outcomes (PO)

Outcomes (CLO)
Course Learning Assessment
Teaching

Assignment

Final Exam
Lab report

Mid Exam
PO10
PO11

PO12
Methods

PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9

Test
L T P O

CLO1 √ √ √ √ √ √ √ √
CLO2 √ √ √ √ √ √ √ √
CLO3 √ √ √ √ √ √ √ √
CLO4 √ √ √ √ √ √
CLO5 √ √ √ √ √ √
CLO6 √ √ √ √ √ √
Indicate the relevancy between the CLO and PO by ticking “√” on the appropriate relevant box
12 Transferable Skills; (Skills learned in the course of study which can be useful and utilized in other settings)
1 MATLAB software skill
13 Distribution of Student Learning Time (SLT)
Teaching and Learning Activities
Total
CLO Guided Guided Independe
(SLT)
Course Content Outline learning Learning nt Learning
(F2F) (NF2F) (NF2F)
L T P O
Chapter One:
Number system and numerical error CLO1 √ √ √ 8hrs.
analysis
1.1. Introduction
1.2. Significant figures
1.3. Representation of Integers and
Fractions
1.4. Number Representation and Storage in
Computers
1.5. Error problems
1.5.1. Round-off error and Truncation
Error
1.5.2. Numerical errors and numerical
cancellation
1.6. Algorithm for Conversion from one
base to another
1.7. Computational Problems and
Algorithms
1.8. Computational Efficiency
1.9. Computational Methods for Error
Estimation
 Chapter Two:
CLO2 √ √ √ 6hrs.
Review of Matrices
2.1. Elementary Properties of Matrices;
2.2. Orthogonality and Ortho normality of
Vectors and Matrices;
2.3. Norm of Vectors and Matrices, System
of Linear Equations
Chapter Three:
CLO3 √ √ √ 18hrs.
Solution of linear Equations
3.1. Introduction
3.2. Existence and Uniqueness of Solutions
3.3. Methods of Solution of Linear
Equations
3.3.1. Direct method
3.3.1.1. Elimination Method
3.3.1.2. Substitution Method
3.3.1.3. Cross multiplication Method
3.3.2. Matrix Method
3.3.2.1. Crammer’s Rule
3.3.2.2. Gauss Elimination Method
3.3.2.3. Gauss-Jordan elimination Method
3.3.2.4. LU decomposition
3.3.3. Iterative methods
3.3.3.1. Jacobi Iterative Method
3.3.3.2. Gauss-Seidel Iterative Method
Chapter Four:
CLO4 √ √ √ 21hrs.
Solution of Nonlinear Equations
4.1. Introduction
4.2. Root finding methods
4.2.1. Bracketing method
4.2.1.1. Graphical Method
4.2.1.2. Bisection Method
4.2.1.3. False –position Method
4.2.2. Open Methods
4.2.2.1. Simple Fixed-point Iteration
4.2.2.2. Newton-Raphson Method
4.2.2.3. Secant Method
4.3. Multiple Roots
4.4. Roots of Polynomials
4.4.1. Convectional Method
4.4.2. Muller’s Method
Chapter Five:
CLO5 √ √ √ 21hrs.
Interpolation and Approximation
5.1. Introduction
5.2. Class of Common Approximation
Functions
5.3. Criteria for the Choice of the
Approximate Function
5.4. Piecewise Polynomial Approximation;
5.5. Curve fitting
5.5.1. Least –Square regression
5.5.1.1. Linear regression
5.5.1.2. Polynomial regression
5.5.1.3. Multiple regression
5.5.2. Interpolation
5.5.2.1. Newton’s Divided –Difference
5.5.2.2. interpolating polynomial
5.5.2.3. Lagrange interpolating polynomial
5.5.2.4. Cubic Spline Interpolation

Chapter Six:
CLO6 √ √ √ 23hrs.
Numerical Differentiation and
Integration
6.1. Numerical Differentiation and
Integration
6.1.1. Numerical Differentiation
6.1.1.1. High –Accuracy Differentiation
formula
6.1.1.2. Richardson Extrapolation
6.1.2. Newton –Cotes Integration formulas
6.1.2.1. The Trapezoidal Rule
6.1.2.2. Simpson’s Rules
6.1.2.3. Integration with Unequal Segment
6.2. Numerical Solutions of Differential
Equations
6.2.1. Ordinary Differential Equations
6.2.1.1. Euler ‘s Method
6.2.1.2. Runge-Kutta Methods
6.2.2. Partial Differential Equations
Finite Difference: Elliptic
Equations
6.2.3. Finite difference: Parabolic
Equations
6.2.3.1. Explicit Methods
6.2.3.2. A Simple Implicit Method
6.2.3.3. The Crank-Nicolson Method
6.2.4. Finite –Element method
6.2.4.1. One -Dimensional Problem
6.2.4.2. Two - Dimensional Problem
Total 97 hrs.
 Assessment
Continuous Assessment Percentage F2F NF2F SLT
Total-60(%)
1 Tests 10 √ 2hrs.
2 Assignments 10 √ 8hrs.
3 Lab report 15 √ 8hrs.
4 Mid exam 25 √ 2hr.
Total 20 hrs.
Final Exam Percentage 40 (%) F2F NF2F SLT
Final Exam 40 √ 3 hrs.
Grand Total SLT 120hrs
.
L = Lecture, T = Tutorial, P = Practical, O = Others, F2F = Face to Face, NF2F = Non-Face to Face
14 Other Requirements
• Minimum 80% during lecture and 100% during practical work sessions except for some unprecedented
mishaps.
• Students are expected to attend all classes regularly and study from text books once the topic is discussed
in classes.
• Students are advised to prepare for classes by reading the available materials before coming to classes and
participate actively to enhance better understanding of the course and attain the learning outcomes.
• There have been many reference books proposed for each topic which will be discussed in class.
• Students are encouraged to read and prepare based on the additional materials.
15 Special requirements and resources to deliver the course 1 Computer lab
(e.g. software, computer lab, simulation room …etc.) 2 MATLAB simulation software
16 Chapra C.S. and Canale P.R., “Numerical Methods for Engineers with
1
Programming and Software Application
2 Recktenwald, Gerald. Numerical Methods with Matlab, Prentice Hall, 2000.
Text book and 3 Erwin Kreysizg, Advanced Engineering Mathematics, 9th edition, Wiley,2005
reference: Brown, J. W. & Churchill, R. V, Complex Variables and Applications, 7th edition,
4
(note: ensure 2003
the latest 5 Steven C. Chapra , Computational methods for engineers,5th edition.
edition Ralston A & P. Rabinowitz: A First Course in Numerical Analysis, 2nd ed, McGraw
6
/publication) Hill,
7 Mohammed Abdo, Introduction to Computational Methods.
Jain M.K., S.R.K. Iyenger and R.K. Jain: Numerical Methods for Scientific and
8
Engineering Computation, 2nd ed, Wiley Eastern Ltd., 1985