The American University in Cairo

ENGR 3202-02: Engineering Analysis and Computation

Fall 2024
Instructor: Dr. Mostafa Youssef, [email protected]
Office: SSE 2030
Office hours: Sun. 11:45 am – 1:45 pm
Wed.11:45 am – 1:45 pm
Or by Email Appointment

Course Coordinator: Dr. Mostafa Youssef, Office SSE2030, [email protected]

Teaching assistants: Eng. Alaa Elfiqi, [email protected]

Office hours: Mon. 12:00 pm – 2:00 pm (SSE 2060)
Wed. 12:00 pm – 2:00 pm (SSE 2060)
Note: You can discuss with other sections TAs as well if you have questions
Eng. Abdallah Al-Khayat , [email protected]
Office hours: Sun. 11:45 am – 1:45 pm (Mech. Eng. Balcony, SSE 2nd floor)
Thur.11:45 am – 1:45 pm (Mech. Eng. Balcony, SSE 2nd floor)

Lecture room: SSE CP 19

Lecture schedule: Sunday and Wednesday 10:00 am - 11:15 am

Course Description:
Solution of sets of linear equations, roots of equations, curve fitting(interpolation), numerical integration
and differentiation, numerical solution of ordinary differential equations, boundary value problems and
introduction to finite-difference methods. The course emphasizes engineering applications and the use of
computer programs for problem solving. It includes a programming based project.

Prerequisite: CSCE 1001 (or MENG 2202 or ENGR 2412) and MACT 2141

Post-requisite: MENG 3502, MENG 3402, MENG 4606, MENG 3505, PENG 4223, ECNG 4301

Credit: 3 credit hours

Textbook: Steven C. Chapra, and Raymond P. Canale, “Numerical Methods for Engineers”, McGraw-
Hill, international 6th edition (2010) or any other edition!

1
Course outcomes
Upon completion of the course, students should be able to:
1-Formulate many engineering problems mathematically, and reduce them to a matrix form appropriate
for solution; the physics of the problems being covered elsewhere.
2-Solve sets of linear algebraic equations employing both direct elimination methods and iterative
solution methods; select the most appropriate solution method for a particular problem; derive the matrix
inverse and use it advantageously to solve input-output problems, and analyze response-stimuli relations.
3- Perform interpolation employing computational methods.
4- Derive real roots of non-linear equations.
5- Perform numerical differentiation and integration.
6- Solve numerically initial value problems involving ordinary differential equations.
7- Employ Finite difference to solve O.D.E. boundary value problems and Elliptic P.D.E.
8- Write computer programs to implement all the above numerical solution methods.
9- Work effectively as a team on a programming based project.

Tentative contents (27 lectures)

1- Introduction to numerical methods, types of errors, and MATLAB (4 lecture)
2- Roots of nonlinear equations (4 lectures)
3- Matrices and Linear algebraic equations (7.5 lectures)
4- Numerical differentiation and integration (3.5 lectures)
5-Numerical solutions of ordinary differential equations (4.5 lectures)
6- Selected topics in numerical solutions of partial differential equations (1 lecture)
7- Curve fitting and interpolation (2.5 lectures)

Grades:
1- Two face-to-face midterms (2 x 20% = 40 %) [See Tentative dates in the TABLE below]
2- Class Participation 10% (including Quizzes and short assignments)
3- Computer-based project (including an oral discussion of the project) 20%
4- Final Comprehensive face-to-face exam 30 %
5- 4% Bonus on MATLAB online Courses [ 4 out of 5 courses]

Makeup policy and regrading requests.

(1) There is a single makeup for a single missed midterm (with an excuse verified by AUC dean of
students or AUC medical). It will be comprehensive and scheduled on the same day as the final exam.
(2) You have one week to review the grading of an assessment from the date the grade was announced.
Requests after one weeks will not be considered.
Communication:
Canvas will be used for class communication.
Questions and inquiries have to be directed during office hours or right after class (in the 15 minutes
between classes). Email questions take much longer to process due to the enormous number of emails I
receive. I discourage email questions and encourage office hours visits.

2
Attendance Policy:
The university attendance policy as communicated regarding the Fall 2024 semester will apply. Failing
to attend several classes affects your grade.

Class Participation
You are encouraged to participate in the class by interacting with the instructor and your peers with
quality responses to enrich the discussion, ask questions to benefit the group, and enrich the community
of learning in this course.

Programming:
Learning MATLAB which is essential for problem sets, the exams, and the term project. MATLAB is
available for free for AUC students from this Link
https://www.mathworks.com/academia/tah-portal/american-university-in-cairo-40766917.html
Please install it as soon as possible! Or alternatively you can user MATLAB online by googling MATLAB
online. You can even install a light version on your phone.
Believe it or not, proficiency in coding can secure a job for you in any engineering discipline!

Bonus: If you take 4 out of the following 5 MATLAB courses and submit a link for your certificate from
MathWorks on Canvas, you will be considered for 4% course bonus. Work on each course once we start
covering it in class. The deadline to submit these certificates is last day of classes (December 9, 2024).
[1] MATLAB Onramp: MATLAB Intro and basics
https://matlabacademy.mathworks.com/R2023a/portal.html?course=gettingstarted
[2] Solving Nonlinear Equations (Rootfinding) with MATLAB
https://matlabacademy.mathworks.com/R2023a/portal.html?course=rootfinding
[3] Introduction to Linear Algebra with MATLAB
https://matlabacademy.mathworks.com/R2024a/portal.html?course=linalg
[4] Solving ODEs with MATLAB
https://matlabacademy.mathworks.com/details/solving-ordinary-differential-equations-with-
matlab/odes
[5] Curve-fitting with MATLAB
Curve Fitting Onramp | Self-Paced Online Courses - MATLAB & Simulink (mathworks.com)

AI:
The use of artificial intelligence (AI) tools and applications (including, but not limited to ChatGPT,
Google Gemini, Midjourney, and AI-enabled tools such as Quillbot) is permitted for assignments in this
course only if instructor permission is obtained in advance. Unless permission is granted, each student
is expected to complete each assignment without the use of AI tools. When permission is granted,
students are expected to properly acknowledge and cite their use. If you have any questions about how
to properly document AI use, it is your responsibility to ask. Non-approved use of AI tools or failure to
acknowledge/cite approved use are considered violations of AUC’s Code of Academic Ethics and will
be reported.

3
Tentative Weekly Schedule

Week U/W M/R

#1 (Sept. 1 – Sept. 5) 1# intro, errors, and MATLAB 1#
2# intro, errors, and MATLAB 2#
Add/drop date Sept. 5 - Attendance/Participation considered after this date
#2 (Sept. 8 – Sept.12) 3# intro, errors, and MATLAB 3#
4# intro, errors, and MATLAB 4#
#3 (Sept.15– Sept. 19) 5# Roots of Equations 5#
6# Roots of Equations 6# Holiday (Mawlid)
#4 (Sept 22. – Sept. 26) 7# Roots of Equations 7#
8# Roots of Equations 8#
#5 (Sept. 29 – Oct. 3) 9# Linear Algebra 9#
10# Linear Algebra 10#
#6 (Oct. 6 – Oct. 10) 11# Linear Algebra 11#
12# Linear Algebra 12# Holiday (Armed forces)
#7 (Oct. 13 – Oct. 17) 13# Linear Algebra 13#
14# Linear Algebra 14#
1st Midterm Exam Saturday Oct. 19 (EXACT TIME TBD)
#8 (Oct. 20 – Oct. 24) 15# Linear Algebra 15#
16# Linear Algebra/ Diff. & Int. 16#
Drop course deadline Thursday Oct. 24
#9 (Oct. 27 – Oct. 31) 17# Diff. & Int. 17#
18# Diff. & Int. 18#
#10 (Nov. 3 – Nov. 7) 19# Diff. & Int. 19#
20# ODE + PDE 20#
#11(Nov. 10 – Nov. 14) 21# ODE + PDE 21#
22# ODE + PDE 22#
#12 (Nov. 17 – Nov. 21) 23# ODE + PDE 23#
24# ODE + PDE 24#
2nd Midterm Exam Saturday Nov. 23 (EXACT TIME TBD)
#13 (Nov. 24 – Nov. 28) 25# ODE + PDE 25#
26# ODE + PDE/ Interpolation 26#(Holiday) Thanksgiving
#14 (Dec. 1 – Dec. 5) 27# Interpolation 27#
28# Interpolation 28#
4
#15 (Dec. 8 – Dec. 12) 29# Project Exam 29# Project Exam
Final Exam – Monday Dec. 16 (2:30 pm - 4:30 pm) → according to registrar
* Makeup Exam for eligible students on Monday Dec. 16 or in week #14.

5
Contents to be covered from 6th edition of Chapra and Canale
Topic 1a: Programming using MATLAB [PROBLEM SET1]
2.1 Packages and Programming.
2.2 Structured programming
2.3 Modular Programming
2.5 MATLAB
Appendix B (Page 933).

Topic 1b: Introduction to numerical methods and types of error [PROBLEM SET 1]
PT1.1 Motivation
3.1 Significant Figures
3.3 Error definitions (only first two pages up to example 3.2 with title: error estimates for iterative
methods).

Topic 2: Roots of Nonlinear Equations [PROBLEM SET 2]

PT2.1 Motivation (page 113)
PT2.2 Mathematical background
5.1 Graphical methods
5.2 The bisection method (except the error analysis on page 128, 129, and the efficient pseudocode on
page 131 is for extra reading only).
5.3 The False-position method (not including modified false-position 5.3.2)
5.4 Incremental searches and determining initial guesses.
6.1 Simple Fixed-Point Iteration (except Box 6.1 on the convergence of the method).
6.2 The Newton-Raphson Method (except Box 6.2 on the error analysis and example 6.4)
6.3 The Secant method (except 6.3.3 on modified secant method).
6.6 Systems of Nonlinear equations (except 6.6.1 Fixed point iteration not covered because it is not
very useful).
PT2.4 Trade-offs page 223

Topic 3: Linear Equations [PROBLEM SETS 3 and 4]

PT3.1 Motivation (Page 227).
PT3.1 Mathematical Background (Page 229).
9.1 Solving small numbers of equations.
9.2 Naïve Gauss elimination (except Operation counting details, final results is discussed)
9.3 Pitfalls of Elimination Methods.
9.4 Techniques for improving solutions (except subsection 9.4.3 scaling, also not including Figure 9.6,
subsection 9.4.4 Computer algorithm and not including example 9.11).
9-7 Gauss-Jordan including its operation counting.
10.2 The matrix inverse (except Figure 10.5). To be taught with Gauss-Jordan.
11.1 Special matrices (except 11.1.2 Cholesky decomposition)
*CHOOSE one of:
12.2 for construction engineers
12.3 for electric/electronic/computer engineers.
12.4 Spring-Mass Systems (Mechanical/ Aerospace).
11.2 Gauss-Seidel, Jacobi, and relaxations (except details in 11.2.1, Just explain convergence is
achieved for diagonally dominant and that this sufficient but not necessary).

6
Topic 4: Integration and Differentiation [PROBLEM SET 5]
PT6.1 Motivation
PT6.1 Mathematical Background
21.1 The Trapezoidal Rule (Not including 21.1.1 error of the trapezoidal rule, and example 21.3 on the
parachutist)
21.2 Simpson’s Rule (Not including box 21.3 on the error and 21.2.5 on Higher-Order Newton-Cotes
formulas).
21.3 Integration with unequal segments (except the computer program figure 21.15).
21.5 Multiple Integrals.
22.1 Newton-Cotes algorithms for equations
22.4 Gauss quadrature (except 22.4.4 on error analysis).
4.1 Taylor Series (Exclude box 4.1, example 4.2, 4.1.1 The Remainder, 4.1.2 Estimating truncation
errors). Focus on 4.1.3 Numerical Differentiation and example 4.4.
**** Figure 4.8 on the trade-off between round of error and truncation error.
23.1 High Accuracy Differentiation Formulas.

Topic 5: Ordinary Differential Equations [PROBLEM SET 6]

PT7.1 Motivation (including transforming high order ODE into systems of 1st order ODEs).
PT7.2 Mathematical Background
25.1 Euler’s method (except error analysis).
25.2 Improvements to Euler’s method (EXCLUDE the MIDPOINT method, covered later in RK2)
25.3 Runge-Kutta Methods (Not including Box25.1, third order RK(23.3.2), higher order RK (25.3.4),
example 25.8, computer algorithms)
25.4 Systems of Equations (except computer algorithm, example 25.11 and the pseudocode in figure
25.18).
PT7.1 Motivation (Page 697, the first two pages explains transforming a higher order initial value
problem into a system of first order ODE’s).
27.1 General methods for boundary value problems (except The shooting method, also we do not
cover the discussion after example 27.3 related to von Neumann boundary conditions)

Topic 6: Partial Differential Equations [PROBLEM SET 6]

PT8.1 Motivation (includes classification of PDE’s).
29.1 The Laplace Equation
29.2 Solution Technique

Topic 7: Interpolation [PROBLEM SET 6]

PT5.1 Motivation
18.1 Newton’s divided-difference interpolating polynomials (except error analysis 18.1.4 and example
18.4).
18.3 Coefficients of an interpolating polynomial
18.6 Spline interpolation (except box 18.3/ cubic splines not covered in class).

7
Bare minimum pseudocodes to be discussed in class or possibly via a recording (either as pseudocodes
or as MATLAB codes).
The students will explore further psuedocodes in the problem sets and/or the project.
1- matrix multiplication (page 234).
2- The bisection method (page 130).
3- Naive Gauss elimination (Figure 9-4).
4-Partial pivoting (page 262).
5- Thomas Algorithm (Figure 11-2).
6- Trapezoidal and Simpson for tables/functions (Page 632).

Theoretical proofs
The instructors are encouraged to do few selected proofs in class (for example the iterative formula of
Newton-Raphson and multiple application of Simpson rule). Some other proofs will be explored in the
exercise.

Course Materials
Instructors provide study materials for the students. This can be in the form of annotated slides,
handouts, lecture notes, and the like. This is in addition to the textbook.