Addis Ababa Science and Technology University

1 College: Department: Mathematics

Natural and Social Science
Course Name Computational Methods
Course Code: ECEg3101
3 Synopsis: The course aims at introducing students in finding numerical solutions to problems for
which analytical solutions either do not exist or are not readily or cheaply obtainable. It
enables students to apply linear algebra and calculus. It also aims to helps student
develop programming skills.
4 Name(s) of Bayable T. & Berta D.
Academic Staff:
5 Semester and Semester II Year: 2
Year offered: :
6 Credit Hour: 4
7 Prerequisite/ Co- Applied Engineering Mathematics III (Math-2022) and C++ Programming (ECEg2108)
requisite:
8 Course Learning Outcome ( CLO): At the end of the course the student will be able to do:
CLO1 Describe basic concepts in error estimation
CLO2 Analyze Nonlinear equations
CLO3 Analyze the concepts of solving System of linear equations and Eigen vectors
CLO4 Evaluate and interpret Curve fitting, Finite differences and Interpolations
CLO5 Analyze Numerical Differentiation and Integration
1CLO6 Develop Understanding of how to find Numerical Solutions of ODEs
9 Mapping of the course Learning Outcomes to the program Learning Outcomes, Teaching Methods and
Assessment:
Program Learning Outcomes (PO)
Teaching Assessment
Outcomes
Learning

Methods
PO12
PO10
PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7
PO8
PO9

Assign

Projec

report
ment
Quiz

Lab-
L T P O Test

t
CLO1 √ √ √ √
CLO2 √ √ √ √ √
CLO3 √ √ √ √ √
CLO4 √ √ √ √ √
CLO5 √ √ √ √
CLO6 √ √ √ √
Indicate the relevancy between the CLO and PO by ticking “√”on the appropriate relevant box
1 Transferable Skills (if applicable)
0 (Skills learned in the course of study which can be useful and utilized in other settings)
1 Distribution of Student Learning Time (SLT)
1 Teaching and Learning Activities Total
CLO Guided learning (F2F) Guided Independent (SLT)
Course Content Outline Learning Learning
(NF2F) (NF2F)
L T P O
Chapter 1:Basic concepts in 1 4 5 1 1 6 17
error estimation
1.1Sources of errors
1.2Absolute and relative errors
1.3Approximations of errors
1.4 Truncation errors and the
Taylor series
1.5 Propagation of errors
Chapter 2:Nonlinear equations 2 6 7 2 1 7 23
2.1Bisection method
2.2Secant method
2.3Newton-Raphson method
2.4 Fixed point iteration
 Chapter 3:System of linear 3 6 7 2 1 7 23
equations, Eigen values and
Eigen vectors
3.1Direct methods for system of
linear equations
3.1.1 Gaussian method*
3.1.2 Gaussian method with
partial pivoting
3.1.3 Jordan's method*
3.1.5 Matrix decomposition
3.1.4 Jordan’s method for
matrix inversion*
3.2Indirect methods for SLE
3.3Eigen values and Eigen
vectors
Chapter 4:Curve fitting, Finite 4 8 7 2 1 7 25
differencesand Interpolations
4.1Shift, Forward difference,
backward difference and
Central difference operators
4.2Lagrange's interpolation
formula
4.3Newton’s divided difference
interpolation formula
4.5 Least square approximation

Chapter 5: Numerical 5 4 5 2 1 6 18
Differentiation and Integration
5.11Numerical Differentiation
5.2Numerical Integration
(Trapezoidal and Simpson's
rule)
Chapter 6: Introduction to 6 2 4 1 1 4 12
Numerical Solutions of ODEs
6.1 Euler’s method
6.2 Runge-Kutta methods
Total 6 30 35 10 6 37 118
Assessment
Continuous Assessment Percentage F2F NF2F SLT
Total-50(%)
1 Tests 20 2 6 8
2 Assignments 10 1 9 10
3 Lab-report 15 1 2 3
4 Quiz 5 1 0 1
Total 22
Final Exam Percentage 50 (%) F2F NF2F SLT
Final Exam 50 3 17 20
Grand Total SLT 160
L = Lecture, T = Tutorial, P = Practical, O = Others, F2F = Face to Face, NF2F = Non Face to Face
Note: indicates the CLO based on the CLO’s numbering in item 9.
1 Textbook and 1 Richard L. Burden, Numerical Analysis, 1981, 2nd Ed.
2 reference: 2 Steven C. Chapraand Raymond P. Canale, Numerical Methods for Engineers, 5 th
3 Robert Ellis and Denny Glick, Calculus with Analytical Geometry 3rd Ed.