Numerical Techniques

You might also like

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 6

Syllabus

Faculty Engineering
Department Renewable Energy Engineering
Semester 1st Semester
Academic Year 2019/2020

Course Name Numerical Techniques


Course Number 0902301

Each student shall receive a copy of the syllabus to be kept for future
.reference

F112-3, Rev. c
Ref.: Deans' Council Session (03/2019-2018), Decision No.:
14, Date: 15/09/2018
1-6
Instructor Information .1

1. Instructor: Dr. Mohammad Alhusban

2. Office: B 334

3. Office Telephone: n/a

4. Email: malhusban@meu.edu.jo

5. Office Hours: 11:30 - 14:00 Monday and Wednesday

2. Course Details

1. Meeting Times: 8:00-9:30 Sunday/Tuesday

2. Location: BB13

3. Course Laboratory (if any): n/a

3. Sources and References

 Textbook: Numerical Methods for Engineers, S.C. Chapra and R.P.


Canale, 7th edition / 2015, McGraw Hill

4. Course Description

Numerical methods are techniques by which mathematical problems


are formulated so that they can be solved with arithmetic operations.
This course will cover introduction to numerical errors and their
sources, approximation, numerical methods of solving linear
equations, methods of solving nonlinear equations, curve fitting,
numerical integration and differentiation, practical examples from
different areas of engineering.
5. Aims and objectives:

This module provides an introduction to the professional life of an


engineer. The aim is to introduce students to the formulation,
methodology, and techniques for numerical solution of engineering
problems.

F112-3, Rev. c
Ref.: Deans' Council Session (03/2019-2018), Decision No.:
14, Date: 15/09/2018
2-6
6. Course Learning Outcomes (CLOs):

1. Analyze useful computing techniques for solving general and


practical engineering problems.

2. Calculate and apply basic numerical approximation techniques to


the solution of mathematical problems involving representation of
functions by Taylor polynomials, to solve systems of simultaneous
linear equations, find roots (s) of nonlinear equation (s), for
Newton, Lagrange interpolations.

3. Design and verify the design of general and practical engineering


problems and using the techniques for numerical solution of
engineering problems.

4. Demonstrate skills in problems solving and analytical thinking.

7. Programme Learning Outcomes (PLOs):

1. Optimal utilization of renewable energy resources.


2. Design and development of renewable energy systems to promote
sustainable economy and energy security.
3. Keep up with the information technology and software required for
renewable energy applications.
4. Professional practice of engineering career within the laws and
regulations.
5. Ethical responsibilities of engineering profession
6. Solving practical engineering problems and making appropriate
decision.
7. Managing renewable energy projects, preparing technical reports,
and engineering drawings.

8. Teaching Methods
The methods of instruction may include, but are not limited to:
1. Lectures
2. Discussion and problem solving
3. Individual assignments/quizzes

F112-3, Rev. c
Ref.: Deans' Council Session (03/2019-2018), Decision No.:
14, Date: 15/09/2018
3-6
# Description Weight Description
1. Mid-term Exam 30% CLOs:1-2
2. Final Exam 50% CLOs: 1-4
3. Assignments 10% To be announced
later
4. Participation+ Quizzes 10% To be announced
later
Total 100%

:Course Schedule .9

Section in
Week Topics to be covered CLOs PLOs
Text

1  Significant figures 3.1 1-2 1-7


 Error analysis 3.3 &3.4
 Truncation errors and Taylor series 4.1
 Bisection method 5.1
 False-Position method 5.2

3  Simple fixed point iteration 6.1 1-4 1-7


 Newton Raphson 6.2
 Secant method 6.3
 System of non-linear equations 6.6
5  Gauss elimination 9.2 1-2,4 1-7
 Gauss-Jordan matrix inversion 9.7
 LU decomposition 10.1
 Gauss-Seidel 11.2

Midterm Exam
8  Linear interpolation 17.1 2-3 1-7
 Newton interpolation 18.1
 Lagrange interpolation polynomials 18.2
10  Simpson’s Rules 21.1 1-2, 1-7
 Newton-Cotes Algorithms for Equations 22.1 4
13  Euler’s methods 25.1 1-4 1-7
 Runge-Kutta methods 25.3
Final Exam

F112-3, Rev. c
Ref.: Deans' Council Session (03/2019-2018), Decision No.:
14, Date: 15/09/2018
4-6
Course Policies .10

 Course policies are determined by Undergraduate and Postgraduate


Degree Regulations and Student Guide

 Policies should be announced during the first meeting.

1. Attendance:
a. Students must attend all classes of this course.
b. Any student with absence of 15% of the classes of any course, will be illegible
to sit for the final exam and will be given the university zero (35%) in this
course.
c. In the case (b) above, if a student submits an official sick report authenticated
by university clinic or an accepted excuse by the Dean of his/her faculty, the
student will be considered as withdrawn from the course, and a "W" will be
shown in the transcript for this course.

2. Delays:
Students are not allowed to come late to classes. Any student coming late will not be
allowed to attend the class and he/she will be marked absent.

3. Exams:
 Failure in attending a course exam other than the final exam, will result in zero
mark unless the student provides an official acceptable excuse to the instructor
who approves a make-up exam.
 Failure in attending the final exam will result in zero mark unless the student
presents an official acceptable excuse to the Dean of his/her faculty who
approves an incomplete exam, normally scheduled to be conducted during the
first two weeks of the successive semester.

4. Assignments and Projects:


Assignments and projects should be submitted to the instructor on the due date. Zero
mark will be given for late submissions unless the student has an acceptable excuse
approved by the instructor of the course.

5. Attending Exams and Meeting Deadlines:

 A student who is late more than 10 minutes will not be permitted to sit the
exam (first, second or mid exams).

F112-3, Rev. c
Ref.: Deans' Council Session (03/2019-2018), Decision No.:
14, Date: 15/09/2018
5-6
 A student who is late more than 30 minutes will not be permitted to sit to final
exam, and no student will be permitted to leave the exam center before the
elapse of 30 minutes.

6. Penalties for Cheating

Cheating is an attempt to gain marks dishonestly and includes; but not limited to:
 Copying from another student’s work.
 Using materials not authorized by the institute.
 Collaborating with another student during a test, without permission.
 Knowingly using, buying, selling, or stealing the contents of a test.
 Plagiarism which means presenting another person’s work or ideas
as one’s own, without attribution.
 Using any media (including mobiles) during the exam.

F112-3, Rev. c
Ref.: Deans' Council Session (03/2019-2018), Decision No.:
14, Date: 15/09/2018
6-6

You might also like