0% found this document useful (0 votes)
51 views4 pages

Course Outline

Uploaded by

merihu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views4 pages

Course Outline

Uploaded by

merihu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Course outline

Course Title: Computational Methods : 3 Pre-requisites:


(2,1,2) ECEG-2101: Introduction to Computing
Course Number: ECEG-2024 Course status: Compulsory
ECTS Credit: 6 Semester: IV
Module: Applied Mathematics Module Coordinator: TBA
Contact Hours(per week): 6 Lecturer: Merihun N.

CHAPTER 1 To introduce different types of 1 week


Number System and Numerical Error Analysis error, Significant figures and
1.1Significant Figures number representation
1.2Accuracy and Precision &Storage in Computers.
1.3 Error Definitions
1.4 Round -Off Errors
1.5 Truncation Errors
1.6 Total Numerical Error
1.7 Representation of Integers and Fractions
1.8 Number Representation and Storage in Computers
CHAPTER 2 To apply different root finding 3 weeks
Roots of Equations methods like Bracketing
2.1 Bracketing Methods methods (Graphical, Bisection,
Graphical Method False-position )and open
Bisection Method methods(Simple Fixed point
False -position Method Iteration, Newton-Raphson
2.2 Open Methods method & Secant methods)
Simple Fixed point Iteration
Newton-Raphson Method
Secant Method
2.3 Multiple Roots
2.4 Systems of Nonlinear Equation
2.5 Roots of Polynomials
Convectional Method
Muller’s Method
CHAPTER 3 Apply the methods used to solve 2 weeks
Linear Algebraic Equations simultaneous equations (Gauss Elimination,
3.1 Introduction Gauss - Jordan, Lu Decomposition and
3.2 Gauss Elimination Method Gauss-Seidel method).
3.3 Gauss -Jordan Method Develop a program that will
3.5 Lu Decomposition solve algebraic equations using
3.6 Gauss-Seidel method the above methods.
CHAPTER 4 Understand the techniques to 2 weeks
Optimization find the minimum or maximum
4.1 One -Dimensional Unconstrained of a function of a single variable
optimization and optimizing in the presence
Golden -Section Search of constraints such as limited
Quadratic Interpolation resource.
Newton’s Method
4.2 constrained optimization
Linear Programming the Simplex Method
CHAPTER 5 To know about curve fitting 2 weeks
Curve Fitting using Least -Square regression
5.1 Least -Square regression and Interpolation methods.
Linear regression
Polynomial regression
Multiple regression
5.2 Interpolation
Newton’s Divided -Difference
interpolating polynomial
Lagrange interpolating polynomial

CHAPTER 6 2 weeks
Numerical Differentiation and Integration To Apply the Trapezoidal and
6.1 Newton -Cotes Integration formulas Simpson’s Rules for
The Trapezoidal Rule Numerical Integration.
Simpson’s Rules
Integration with Unequal
Segments To apply High -Accuracy
6.2 Numerical Differentiation Differentiation formulas and
High -Accuracy Differentiation Richardson Extrapolation for
formulas Numerical Differentiation.
Richardson Extrapolation
CHAPTER 7 3 weeks
Numerical Solutions of Differential
Equations To enable students to find
7.1 Ordinary Differential Equations Numerical Solutions of
Euler’s Method Differential Equations using
Runge-Kutta Methods Euler’s and Runge-Kutta
Method
7.2 Partial Differential Equations

7.2.1Finite Difference: Elliptic


Equations
The Laplace Equations
Solution Techniques
Boundary Conditions
7.2.2Finite Difference: Parabolic
Equations
Explicit Methods
A Simple Implicit Method
The Crank-Nicolson Method
7.2.3 Finite -Element method
One -Dimensional Problem
Two - Dimensional Problem

Teaching & Learning Methods Lecture supported by tutorial, programming


exercises and assignments
Assessment/Evaluation Attendance (5%); Assignment (20%), Chapter
Quizzes (15%); Tests (20%); Final Examination
(40%)
Attendance Requirements 75% lecture attendance
Literature Textbook:
Steven C.Chapra, Numerical Methods for Engineers
References:
 Ralston A. and P. Rabinowitz: A First
Course in Numerical Analysis, 2nd ed,
McGraw Hill, New York, 1987
 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 Computation, 2nd ed, Wiley
Eastern Ltd., 1985

You might also like