School of Electrical and Computer Engineering
Course Title: Computational Methods
Course Number: ECEG-2112
ECTS Credits: 6
Instructor’s: Yonas Y. (
[email protected])
Abiy T. (
[email protected])
Assistant’s: Hailemelekot D. (
[email protected])
Bazen G. (
[email protected])
Biruk A. (
[email protected])
Course Objectives
• To understand and implement the fundamental computational methods to solve scientific and engineering
problems.
• To introduce modern approximation techniques; to explain how, why, and when they can be expected to
work; and to provide a foundation for further study of numerical analysis and scientific computing.
Contents
1. Introduction to Computational Methods (1 Week)
1.1. Introduction
1.2. Objective
1.3. Application
2. Number System and Numerical Error Analysis (2 Weeks)
2.1. The Error Problem
2.2. Representation of Integers and Fractions
2.3. Number Representation and Storage in Computers
2.4. Rounding Off Problem
2.5. Numerical Error and Significant Digits
2.6. Base Conversion Algorithms
2.7. Computational problems, Algorithms and Efficiency
2.8. Computational Methods for Error Estimation
3. Solutions of Nonlinear Equations (2.5 Weeks)
3.1. Methods used in Root Finding
3.2. Summary of the Solutions of Nonlinear Equations
3.3. Fixed Point Iteration
3.4. Real Roots of Polynomial Equation
3.5. Iterative Methods for Finding Real Zeros of a Polynomial
3.6. Order of Convergence
4. Review Matrices (1 Week)
4.1. Elementary Properties of Matrices
4.2. Orthogonality and Orthonormality of Vectors and Matrices
4.3. Norm of Vectors and Matrices
1
5. System of Linear Equations (2 Weeks)
5.1. Existence and Uniqueness of Solutions
5.2. Methods of Solution of Linear Equations
6. Solution of Systems of Nonlinear Equations (1.5 Weeks)
6.1. The Iterative Method
6.2. The Newton-Raphson Method
7. Interpolation and Approximation (2 Weeks)
7.1. Class of Common Approximation Functions
7.2. Criteria for the Choice of the Approximate Function
7.3. Finite Differences and Divided Differences
7.4. Interpolation by Polynomials
7.5. Least Square Approximation by Polynomials
7.6. Piecewise Polynomial Approximation
7.7. Cubic Spline Interpolation
8. Numerical Differentiation and Integration (1 Week)
8.1. Numerical Differentiation
8.2. Numerical Integration
9. Numerical Solutions of Differential Equations (1 Week)
9.1. Ordinary Differential Equations
9.2. Partial Differential Equations
Course policy
Prerequisite: Introduction to Computing
Teaching & Learning Methods: Lectures, Tutorials and Lab Exercises
Assessment/Evaluation: Continuous Assessment with Assignment, Tests and Programming Exercises
(50%), Final examination (50%)
Attendance Requirements: [Lecture & Tutorial: 75%, Laboratory: 100%]
Literature:
• Textbook
– Uri M. Ascher and Chen Greif: A First Course in Numerical Methods. SIAM, 2011.
– Todd Young and Martin J. Mohlenkamp: Introduction to Numerical Methods and MATLAB Pro-
gramming for Engineers. (For the Lab Session)
• References
– Mohammed Abdo: Introduction to Computational Methods, 2000
– Conte S.D. and Carl de Boor: Elementary Numerical Analysis An Algorithm Approach, 3rd ed,
McGraw Hill Int. Student ed, 1981
– Jain M.K., S.R.K. Iyenger and R.K. Jain: Numerical Methods for Scientific and Engineering Com-
putation, 2nd ed, Wiley Eastern Ltd., 1985
