80a03a75-aeec-4549-8f42-eb6b75ecf4d8_
80a03a75-aeec-4549-8f42-eb6b75ecf4d8_
80a03a75-aeec-4549-8f42-eb6b75ecf4d8_
2
A. Course Identification
1. Credit hours: ( 3)
2. Course type
a. University College Department √ Others
b. Required √ Elective
3. Level/year at which this course is offered: 7th level, 4th year
4. Pre-requisites for this course (if any):
Ordinary differential equations (2022201-4)
Differential equations (2023103-4)
5. Co-requisites for this course (if any):
None
3
2. Course Main Objective
1- Developing and implementing numerically stable and accurate algorithms for all the
basic tasks of computational science and engineering:
2- Finding acceptable approximate solutions when exact solutions are either impossible
or so arduous and time-consuming as to be impractical.
C. Course Content
Contact
No List of Topics
Hours
Preliminaries of Computing : Basic concepts: Round-off Errors, Floating
1 3
Point Arithmetic, Error Estimation, Convergence.
Numerical Linear Algebra:
2 Iterative methods: Jacobi’s Iteration Methods, Gauss-Seidal Iteration 6
Methods.
Numerical Solution of Nonlinear Equations:
Bisection Method.
3 Newton Raphson’s Method. 6
Successive Approximation Method (Fixed point iteration).
Error Analysis for Iterative Methods.
Finite Differences and Interpolation:
4 1) Finite Difference Operator. 3
1st Mid term exam.
Interpolation and Polynomial Approximation:
1) Interpolation with Equal Intervals: Newton’s Forward
5 Interpolation- Newton’s Backward Interpolation. 9
Interpolation with Unequal Intervals: Lagrange Formula- Newton ‘s
Divided Difference.
Numerical Differentiation and Integration
1) Numerical Differentiation: using Newton’s forward interpolation-
using Newton ‘s divided difference.
6 6
2) Numerical Integration: Trapezoidal rule- Simpson’s rule-
Simpson’s 3/8 rule
4
8 Computer implementations of selected numerical algorithms 3
Total 45
3.0 Competence
3.1 Work effectively within groups and Projects. Through the oral
independently. presentation of the
projects.
Associated academic staff, who involved in the teaching of this course should be available in
their office for at least 6 hours per week for individual student consultations and academic advice
5
F. Learning Resources and Facilities
1.Learning Resources
Richard L. Burden and J. Douglas Faires, Numerical Analysis(2011), 10th
Edition. Student Edition: ISBN-10:0-534-39200-8.
Required Textbooks
https://fac.ksu.edu.sa/sites/default/files/numerical_analysis_9th.pdf
Other Learning
N/A
Materials
2. Facilities Required
Item Resources
Accommodation Classrooms that are equipped with PC and retro
(Classrooms, laboratories, demonstration projector with a maximum of 30 students.
rooms/labs, etc.)
Technology Resources The computers are equipped with some required
(AV, data show, Smart Board, software, mathematical software such as Matlab.
etc.)
Other Resources
(Specify, e.g. if specific laboratory
N/A
equipment is required, list requirements or
attach a list)
Effectiveness of teaching
Students Indirect
and assessment
Extent of achievement of
Peer reviewer Direct
course learning outcomes
6
Evaluation areas (e.g., Effectiveness of teaching and assessment, Extent of achievement of course learning
outcomes, Quality of learning resources, etc.)
Evaluators (Students, Faculty, Program Leaders, Peer Reviewer, Others (specify)
Assessment Methods (Direct, Indirect)