Numerical Methods

By: Jose Antonio E. Rodavia Jr., ME

 COURSE DETAILS

Course No. CE312g

Course Title Numerical Methods for CE Problems
Credit 3 units (2 units lecture 1 unit lab)
No. of contact hrs/week 5 hours (2 hrs. lecture 3 hrs. Lab)
Pre-requisites Math221g (Adv. Engg Math)
Classification/Field Fundamental Course
Term 1st Semester
 The course provides background on numerical analysis

Detailed Description:
needed to solve civil engineering problems numerically
when their analytical solution either not available or
difficult to obtain. MATLAB programming environment or
its equivalent will be introduced and used in the course.
Course Outcomes
 COURSE OUTLINE

• Review of the Mathematical Foundation

• Curve Fitting and Interpolation

• Solving Roots of Nonlinear Equations

• Numerical Differentiation

• Bracketing Methods
• Open Methods
• Solving Systems of Linear Equations
• Numerical Integration
• Solutions of Ordinary Differential
Equations: Initial Value Problems

• Gauss Elimination Method • Solutions of Ordinary Differential

Equations: Boundary-Value Problems
• Gauss-Seidel Method
 TEXTBOOK
• Numerical Methods for Engineers by Steven C. Chapra
 IMPORTANT
September 1 – 4 : Prelim Exam
September 15 – 20 : Penafrancia Fiesta
October 8 – 12 : Midterm Exam
November 12 – 16 : Semi – Final Exam
DATES
December 15 – 18 : Final Exam
December 18 : Last Day of classes
 COMPUTER / PENCIL/PEN NOTEBOOK
SMARTPHONE

COURSE REQUIREMENTS
COURSE REQUIREMENTS
• Blackboard Learn
• Notebloc/Cam Scanner
• MS Excel
 Grading System
Midterm Finals
Assessments Percentage Assessments Percentage
Quizzes 30% Quizzes 30%
Lab Exercises 20% Lab Exercises 20%
Examination 50% Examination 50%
Total 100% Total 100%
General Average 40% Midterm Ave + 60% Final Ave.
Required Gen Ave. to Pass 75%
 Numerical Rating Equivalent Grade
99% to 100% 1.00
96% to 98% 1.25
93% to 95% 1.50
90% to 92% 1.75
87% to 89% 2.00

Grading Scale
84% to 86% 2.25
81% to 83% 2.50
78% to 80% 2.75
75% to 77% 3.00
Below 75 5.00
Dropped Drp
 Before Exam
Schedule

• Secure Exam Permit

• Look for a quiet place and stable internet
connection
• Prepare your paper and pen
• Clean your desk/table
 Types of Exam
Asynchronous Synchronous
• Exam is time limited
• Exam is time limited
• Camera should be ON/OPEN while
• Available at specific date and
exam is on going
time
• Wear decent clothes
• One attempt only
• Available at specific date and time
• Exam will be given through BB
• One attempt only
• No other person in the room
throughout the exam session • Exam will be given through BB
• No other person in the room
throughout the exam session
 Attendance
• According to CHED policy,
total number of absences by
the students should not be
more than 20% of the total
number of meetings or 11 hrs
for this subject. Student
incurring more than 11 hrs of
absences automatically gets a
failing grade regardless of
class standing.
• Attendance will be checked
through Blackboard.
 Submission of
Assessment Tasks
• All assessment tasks must
be submitted using
Blackboard Learn
• Late submission of
assessments will be
accepted but there will be
deductions
INSTRUCTION
INSTRUCTION
Numerical Methods
•Techniques to approximate mathematical procedures
•Involves large numbers of tedious arithmetic calculations

Examples of Mathematical Procedures

1. Finding roots
• Bracketing method
• Open method
2. Systems of Linear Equations
• Gauss Elimination
• Gauss – Jordan
• Gauss – Seidel
3. Differentiation/Integration
• Newton – Cotes Integration
Formulas
• Numerical Differentiation
4. Ordinary Differential Equations
• Runge-Kuta
• Euler’s Method
Finding Roots
- The process of solving for the values of x such that

Categories in Finding Roots

1. Bracketing Method
• Bisection Method
• False – Position Method

2. Open Method
0
• Newton – Raphson’s Method
• Secant Method
Bisection Method
Bisection Method Solution Steps
1. Choose lower and upper guesses for the root such that the function changes sign
over the interval. This can be checked by ensuring that the
2. An estimate of the root is determined by

3. Make the following evaluations to determine in which subinterval the root lies:
a. If , the root lies in the lower subinterval. Therefore, set and
return to step 2.
b. If , the root lies in the upper subinterval. Therefore, set and
return to step 2.
c. If , the root equals to ; terminate the computation.
4. Check the percent relative error,

∗ %
Sample Problem (BISECTION METHOD)

Determine the true root of the equation f(x) = x3 – x – 4 = 0