CpE 221 – Numerical

Methods

This is a property of
PRESIDENT RAMON MAGSAYSAY STATE UNIVERSITY
NOT FOR SALE
CpE 221 – Numerical Methods
Second Edition, 2023

Copyright. Republic Act 8293 Section 176 provides that “No copyright shall subsist in any work of
the Government of the Philippines. However, prior approval of the government agency or office
wherein the work is created shall be necessary for exploitation of such work for profit. Such agency or
office may, among other things, impose as a condition the payment of royalties.

Borrowed materials included in this module are owned by their respective copyright holders. Every
effort has been exerted to reach and seek permission to use these materials from their respective
copyright owners. The University and authors do not claim ownership over them.

Learning Module Development Team

Assigned
Title Author
Chapter
Chapter 1: Introduction to Numerical Methods
Chapter 2: Roots of an Equation Dionisio M. Martin Jr.
Chapter 3: System of Linear Equation

Evaluators:

(First Name, Middle Initial, Last Name), Position

(First Name, Middle Initial, Last Name), Position
(First Name, Middle Initial, Last Name), Position
Course Overview
Introduction

Numerical Methods is a three-unit computer engineering professional course, that requires

knowledge in calculus and differential equation. This course discusses the root findings,
systems of equations, least-squares approximation, interpolation, integration and the ordinary
differential equations.

Numerical methods are techniques to approximate mathematical procedures (e.g., integrals).

Approximations are needed because we either cannot solve the procedure analytically (e.g., the
standard normal cumulative distribution function) or because the analytical method is
intractable (e.g., solving a set of a thousand simultaneous linear equations for a thousand
unknowns). By end of this course, students will be able to apply the numerical methods for
the following mathematical procedures and topics: differentiation, nonlinear equations, and
simultaneous linear equations, interpolation, regression, integration, and ordinary differential
equations. Additionally, they will be able to calculate errors and implement their relationship
to the accuracy of the numerical solutions. To be prepared for this course, students should have
a passing grade in introductory physics, integral calculus, differential calculus, and ordinary
differential equations.

Course General Objectives

At the end of the semester, 85% of the students have attained 90% level of understanding for
being aware in the engineering economics, locally and globally.

1. Understand the concepts of numerical methods in solving functions.

2. Recognize the difference between analytical and numerical solutions.
3. Understand and used the rules truncation and round-off as well as the concept of
significant figures, accuracy and precision.
4. Familiar with the concepts of stability and conditions.
5. Understand the difference between bracketing and open method for root location.
6. Familiar with terminology such as forward elimination, back substitution, pivot
equation and pivot coefficient.
7. Solve problems using the inverse and matrix norms to evaluate system condition.
8. Understand the difference between local and global truncation errors and how they
relate to the choice of a numerical method for a particular problem.

Course Details:

• Course Code: CpE 221

• Course Title: Numerical Methods
• No. of Units: 3-unit lecture
• Classification: Lecture-based
• Pre-requisite / Co-Requisite: Differential Equations
• Semester and Academic Year: 2nd Semester, AY 2022-2023
• Schedule: Open CpE 2A – Monday, Wednesday and Friday, 3:00PM-4:00PM
Open CpE 2B – Monday, Wednesday and Friday, 4:00PM-5:00PM
• Name of Faculty: Dionisio M. Martin Jr.
• Contact Details
Email: [email protected]
Mobile Number: 0939-906-0585
FB Account: Dionisio Martin Jr.
• Consultation
Day: TTH
Time: 8:00-9:30AM

Learning Management System

The University LMS will be used for asynchronous learning and assessment. The link and class
code for LMS will be provided at the start of class through the class’ official Facebook Group.

• Edmodo
• Google Classroom
• University LMS

Assessment with Rubrics

Students will be assessed in a regular basis thru quizzes, assignments, individual/group outputs
using synchronous and/or asynchronous modalities or submission of SLM exercises. Rubrics
are also provided for evaluation of individual/group outputs.

Major examinations will be given as scheduled. The scope and coverage of the examination
will be based on the lessons/topics as plotted in the course syllabus.
 0323

Module Overview
Introduction

This module aims to introduce the concepts of numerical analysis in dealing with engineering
problems and techniques in finding the root of an equations, solving linear and non-linear
equations, polynomial approximation and interpolation, and the ordinary differential equations.

Numerical methods are techniques by which mathematical problems are formulated so that
engineers can solved with different arithmetic operations. Although there are many kinds of
numerical methods, they have one common characteristic: they invariably involve large
numbers of tedious arithmetic calculations.

The students will learn how to solve mathematical problems using different arithmetic
operations at the end of each lesson/chapter.

Table of Contents

Chapter 1: Introduction to Numerical Methods

Chapter 2: Roots of an Equation
Chapter 3: System of Linear Equation
 Numerical Methods

Chapter 3

System of Linear Equation

– Part I
Chapter 3

System of Linear Equations

Introduction

Systems of linear equations that have to be solved simultaneously arise in problems that include
several (possibly many) variables that are dependent on each other. Such problems occur not
only in engineering and science, which are the focus of this book, but in virtually any discipline
(business, statistics, economics, etc.). A system of two (or three) equations with two (or three)
unknowns can be solved manually by substitution or other mathematical methods. Solving a
system in this way is practically impossible as the number of equations (and unknowns)
increases beyond three.

In this chapter, we will explore the concept of simultaneous linear equations and learn how to
solve them using different methods of solving. We shall discuss the simultaneous equations
rules and also solve a few examples based on the concept for a better understanding.

Three direct methods for solving systems of equations – Gauss elimination, Gauss-Jordan, and
LU decomposition and two indirect (iterative) methods – Jacobi and Gauss-Seidel are going to
discuss in this chapter.

Specific Objectives

At the end of the lesson, the students should be able to:

- know the different method use in solving a system of linear equations
- understand and familiar the concept and algorithm of different method use in solving a
system of linear equations
- solve problems for finding the variable a system of linear equations using Gauss
elimination method.

Duration

Chapter 3: System of Linear Equations – Part I = 9 hours

(8.5-hours discussion;
0.5-hour assessment)

_____________________________________________

Solving a System of Linear Algebraic Equations

The general form of a system of 𝑛 linear algebraic equations is:
𝑎11 𝑥1 + 𝑎12 𝑥2 + . . . + 𝑎1𝑛 𝑥𝑛 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + . . . + 𝑎2𝑛 𝑥𝑛 = 𝑏2
⋮ ⋮ ⋮ ⋮
𝑎𝑛1 𝑥1 + 𝑎𝑛2 𝑥2 + . . . + 𝑎𝑛𝑛 𝑥𝑛 = 𝑏𝑛
 And the matrix form of the equations is
𝑎11 𝑎12 ⋯ 𝑎1𝑛 𝑥1 𝑏1
𝑎21 𝑎22 ⋯ 𝑎2𝑛 𝑥2 𝑏
[ ] [ ] = [ 2]
⋮ ⋮ ⋯ ⋮ ⋮ ⋮
𝑎𝑛1 𝑎𝑛2 ⋯ 𝑎𝑛𝑛 𝑥𝑛 𝑏𝑛
Two types of numerical methods, direct and iterative, are used for solving systems of linear
algebraic equations. In direct methods, the solution is calculated by performing arithmetic
operations with the equations. In iterative methods, an initial approximate solution is assumed
and then used in an iterative process for obtaining successively more accurate solutions.

Direct methods
In direct methods, the system of equations that is initially given in the general form is
manipulated to an equivalent system of equations that can be easily solved. Three systems of
equations that can be easily solved are the upper triangular, lower triangular, and diagonal
forms.
The upper triangular form is
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 + . . . + 𝑎1𝑛 𝑥𝑛 = 𝑏1
𝑎22 𝑥2 + 𝑎23 𝑥3 + . . . + 𝑎2𝑛 𝑥𝑛 = 𝑏2
𝑎33 𝑥3 + . . . + 𝑎3𝑛 𝑥𝑛 = 𝑏3
⋮ ⋮
𝑎𝑛−1∙𝑛−1 𝑥𝑛−1 + 𝑎𝑛−1∙𝑛 𝑥𝑛 = 𝑏𝑛−1
𝑎𝑛𝑛 𝑥𝑛 = 𝑏𝑛
and is written in a matrix form for a system of four equations in
𝑎11 𝑎12 𝑎13 𝑎14 𝑥1 𝑏1
0 𝑎22 𝑎23 𝑎24 𝑥2 𝑏2
[ 0 0 𝑎33 𝑎34 ] [𝑥3 ] = [𝑏3 ]
0 0 0 𝑎44 𝑥4 𝑏4
The system in this form has all zero coefficients below the diagonal and is solved by a
procedure called back substitution. It starts with the last equation, which is solved for 𝑥𝑛 . The
value of 𝑥𝑛 is then substituted in the next-to-the-last equation, which is solved for 𝑥𝑛−1 . The
process continues in the same manner all the way up to the first equation. In the case of four
equations, the solution is given by
𝑏4
𝑥4 =
𝑎44

𝑏3−𝑎34𝑥4
𝑥3 =
𝑎33

𝑏2 −(𝑎23 𝑥3 +𝑎24 𝑥4 )
𝑥2 =
𝑎22

𝑏1 −(𝑎12 𝑥2 +𝑎13 𝑥3 +𝑎14 𝑥4)

𝑥1 =
𝑎11

For a system of n equations in upper triangular form, a general formula for the solution using
back substitution is
𝑏𝑛
𝑥𝑛 =
𝑎𝑛𝑛
 𝑗=𝑛
𝑏𝑖 −∑𝑗=𝑖+1 𝑎𝑖𝑗 𝑥𝑗
𝑥𝑖 = 𝑖 = 𝑛 − 1, 𝑛 − 2, … , 1
𝑎𝑖𝑖

The lower triangular form is

𝑎11 𝑥1 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 = 𝑏2
𝑎31 𝑥1 + 𝑎32 𝑥2 + 𝑎33 𝑥3 = 𝑏3
⋮ ⋮
𝑎𝑛1 𝑥1 + 𝑎𝑛2 𝑥2 + 𝑎𝑛3 𝑥3 + . . . + 𝑎𝑛𝑛 𝑥𝑛 = 𝑏𝑛
and is written in a matrix form for a system of four equations in
𝑎11 0 0 0 𝑥1 𝑏1
𝑎21 𝑎22 0 0 𝑥2 𝑏
[ ] [ ] = [ 2]
𝑎31 𝑎32 𝑎33 0 𝑥3 𝑏3
𝑎41 𝑎42 𝑎43 𝑎44 𝑥4 𝑏4
The system in this form has zero coefficients above the diagonal. A system in lower triangular
form is solved in the same way as the upper triangular form but in an opposite order. The
procedure is called forward substitution. It starts with the first equation, which is solved for 𝑥1 .
The value of 𝑥1 is then substituted in the second equation, which is solved for 𝑥2 . The process
continues in the same manner all the way down to the last equation. In the case of four
equations, the solution is given by
𝑏1
𝑥1 =
𝑎11
𝑏2−𝑎21𝑥1
𝑥2 =
𝑎22
𝑏3 −(𝑎31 𝑥1 +𝑎32 𝑥2 )
𝑥3 =
𝑎33
𝑏4 −(𝑎41 𝑥1 +𝑎42 𝑥2 +𝑎43 𝑥3 )
𝑥4 =
𝑎44

For a system of n equations in lower triangular form, a general formula for the solution using
forward substitution is
𝑏1
𝑥1 =
𝑎11
𝑗=𝑖−1
𝑏𝑖 −∑𝑗=1 𝑎𝑖𝑗 𝑥𝑗
𝑥𝑖 = 𝑖 = 1, 2, … , 𝑛
𝑎𝑖𝑖

The diagonal form of a system of linear equations is

𝑎11 𝑥1 = 𝑏1
𝑎22 𝑥2 = 𝑏2
𝑎33 𝑥3 = 𝑏3
⋮ ⋮
+ 𝑎𝑛𝑛 𝑥𝑛 = 𝑏𝑛
and is written in a matrix form for a system of four equations in
𝑎11 0 0 0 𝑥1 𝑏1
0 𝑎22 0 0 𝑥2 𝑏
[ ] [ ] = [ 2]
0 0 𝑎33 0 𝑥3 𝑏3
0 0 0 𝑎44 𝑥4 𝑏4
Gauss Elimination Method 1
The Gauss elimination method is a procedure for solving a system of linear equations. In
this procedure, a system of equations that is given in a general form is manipulated to be in
upper triangular form, which is then solved by using back substitution. For a set of four
equations with four unknowns the general form is given by:
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 + 𝑎14 𝑥4 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + 𝑎23 𝑥3 + 𝑎24 𝑥4 = 𝑏2
𝑎31 𝑥1 + 𝑎32 𝑥2 + 𝑎33 𝑥3 + 𝑎34 𝑥4 = 𝑏3
𝑎41 𝑥1 + 𝑎42 𝑥2 + 𝑎43 𝑥3 + 𝑎44 𝑥4 = 𝑏4
The matrix form of the system is shown
𝑎11 𝑎12 𝑎13 𝑎14 𝑥1 𝑏1
𝑎21 𝑎22 𝑎23 𝑎24 𝑥2 𝑏2
[𝑎 𝑎32 𝑎33 𝑎34 ] [𝑥3 ] = [𝑏3 ]
31
𝑎41 𝑎42 𝑎43 𝑎44 𝑥4 𝑏4
In the Gauss elimination method, the system of equations is manipulated into an
equivalent system of equations that has the form as
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 + 𝑎14 𝑥4 = 𝑏1
𝑎′22 𝑥2 + 𝑎′23 𝑥3 + 𝑎′24 𝑥4 = 𝑏′2
𝑎′33 𝑥3 + 𝑎′34 𝑥4 = 𝑏′3
𝑎′44 𝑥4 = 𝑏′4
The first equation in the equivalent system, is the same as original equation. In the second
equation, the variable 𝑥1 is eliminated. In the third equation, the variables 𝑥1 and 𝑥2 are
eliminated. In the fourth equation, the variables 𝑥1 , 𝑥2 , and 𝑥3 are eliminated. The matrix
form of the equivalent system is shown as
𝑎11 𝑎12 𝑎13 𝑎14 𝑥1 𝑏1
0 𝑎′22 𝑎′23 𝑎′24 𝑥2 𝑏′2
[ 0 0 𝑎′33 𝑎′34 ] [𝑥3 ] = 𝑏′3
0 0 0 𝑎′44 𝑥4 [𝑏′4 ]
The system of equations is in upper triangular form, which can be easily solved by using
back substitution.

Example 1: Solve the following system of four equations using upper triangular form.
4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12
−6𝑥1 + 7𝑥2 + 6.5𝑥3 − 6𝑥4 = −6.5
𝑥1 + 7.5𝑥2 + 6.25𝑥3 + 5.5𝑥4 = 16
−12𝑥1 + 22𝑥2 + 15.5𝑥3 − 𝑥4 = 17
Solution:
Step 1: Pivot equation = 1st and pivot coefficient=4
−6
𝑚= = 1.5
4

(−1.5)(4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12)

−6𝑥1 + 3𝑥2 + 4.5𝑥3 − 9𝑥4 = −18
 Subtract to Eqt. 2:
(−6𝑥1 + 7𝑥2 + 6.5𝑥3 − 6𝑥4 = −6.5) − (−6𝑥1 + 3𝑥2 + 4.5𝑥3 − 9𝑥4 = −18)
0𝑥1 + 4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5

1
𝑚 = 4 = 0.25

(0.25)(4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12)

𝑥1 − 0.5𝑥2 − 0.75𝑥3 + 1.5𝑥4 = 3
Subtract to Eqt. 3:
(𝑥1 + 7.5𝑥2 + 6.25𝑥3 + 5.5𝑥4 = 16) − (𝑥1 − 0.5𝑥2 − 0.75𝑥3 + 1.5𝑥4 = 3)
0𝑥1 + 8𝑥2 + 7𝑥3 + 4𝑥4 = 13

−12
𝑚= = −3
4

(−3)(4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12)

−12𝑥1 + 6𝑥2 + 9𝑥3 − 18𝑥4 = −36
Subtract to Eqt. 4:
(−12𝑥1 + 22𝑥2 + 15.5𝑥3 − 𝑥4 = 17) − (−12𝑥1 + 6𝑥2 + 9𝑥3 − 18𝑥4 = −36)
0𝑥1 + 16𝑥2 + 6.5𝑥3 + 17𝑥4 = 53

Then:
4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12
4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5
8𝑥2 + 7𝑥3 + 4𝑥4 = 13
16𝑥2 + 6.5𝑥3 + 17𝑥4 = 53

Step 2: Pivot equation = 2nd and pivot coefficient=4

8
𝑚=4=2

(2)(4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5)

8𝑥2 + 4𝑥3 + 6𝑥4 = 23
Subtract to Eqt. 3:
(8𝑥2 + 7𝑥3 + 4𝑥4 = 13) − (8𝑥2 + 4𝑥3 + 6𝑥4 = 23)
0𝑥2 + 3𝑥3 − 2𝑥4 = −10
16
𝑚= =4
4

(4)(4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5)

16𝑥2 + 8𝑥3 + 12𝑥4 = 46
Subtract to Eqt. 4:
(16𝑥2 + 6.5𝑥3 + 17𝑥4 = 53 ) − (16𝑥2 + 8𝑥3 + 12𝑥4 = 46)
0𝑥2 − 1.5𝑥3 + 5𝑥4 = 7
Then:
4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12
4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5
3𝑥3 − 2𝑥4 = −10
−1.5𝑥3 + 5𝑥4 =7
 Step 3: Pivot equation = 3rd and pivot coefficient=3
−1.5
𝑚= = −0.5
3

(−0.5)(3𝑥3 − 2𝑥4 = −10)

1.5𝑥3 + 𝑥4 = 5
Subtract to Eqt. 4:
(−1.5𝑥3 + 5𝑥4 = 7) − (1.5𝑥3 + 𝑥4 = 5)
0𝑥3 + 4𝑥4 = 2
Then:
4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12
4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5
3𝑥3 − 2𝑥4 = −10
4𝑥4 =2
Then, by back substitution:
For 𝑥4 :
4𝑥4 = 2
2
𝑥4 = = 𝟎. 𝟓
4
For 𝑥3 :
3𝑥3 − 2𝑥4 = −10
−10+2𝑥4
𝑥3 =
3
−10+2(0.5)
𝑥3 = = −𝟑
3
For 𝑥2 :
4𝑥2 + 2𝑥3 + 3𝑥4 = 11.5
11.5−2𝑥3 −3𝑥4 )
𝑥2 =
4
11.5−2(−3)−3(0.5)
𝑥2 = =𝟒
4
For 𝑥1 :
4𝑥1 − 2𝑥2 − 3𝑥3 + 6𝑥4 = 12
12+ 2𝑥2 + 3𝑥3 − 6𝑥4
𝑥1 =
4
12+ 2(4)+ 3(−3)− 6(0.5)
𝑥1 = =𝟐
4

Gauss Elimination Method 2

In mathematics, the Gauss elimination method is known as the row reduction algorithm for
solving linear equations systems. It consists of a sequence of operations performed on the
corresponding matrix of coefficients.
To perform row reduction on a matrix, we have to complete a sequence of elementary row
operations to transform the matrix till we get 0s (i.e., zeros) on the lower left-hand corner of
the matrix as much as possible. That means the obtained matrix should be an upper triangular
matrix. There are three types of elementary row operations and these are:
• Swapping two rows and this can be expressed using the notation ↔, for example, 𝑅2 ↔
𝑅3
 • Multiplying a row by a nonzero number, for example, 𝑅1 → 𝑘𝑅2 where 𝑘 is some
nonzero number
• Adding a multiple of one row to another row, for example, 𝑅2 → 𝑅2 + 3𝑅1
The obtained matrix will be in row echelon form. The matrix is said to be in reduced row-
echelon form when all of the leading coefficients equal 1, and every column containing a
leading coefficient has zeros elsewhere. This final form is unique; that means it is independent
of the sequence of row operations used.

Note: Transform the matrix into upper/lower triangular matrix then use backward/forward
substitution.

Example 2: Find the value of the given variables by using Gauss elimination method: 𝑥 +
3𝑦 + 6𝑧 = 12, 𝑥 + 4𝑦 + 5𝑧 = 14 and 𝑥 + 6𝑦 + 7𝑧 = 18 using upper triangular form.
Solution:
Given system of equations are:
𝑥 + 3𝑦 + 6𝑧 = 12
𝑥 + 4𝑦 + 5𝑧 = 14
𝑥 + 6𝑦 + 7𝑧 = 18
The augmented matrix:
1 3 6 12
[1 4 5|14]
1 6 7 18
Using upper ∆ matrix:
𝑅2 → 𝑅2 − 𝑅1 and 𝑅3 → 𝑅3 − 𝑅1
1 3 6 12
[0 1 −1| 2 ]
0 3 1 6
𝑅3 → 𝑅3 − 3𝑅2
1 3 6 12
[0 1 −1| 2 ]
0 0 4 0
Then:
for z: for y: for x:
𝑧=0 𝑦−𝑧 = 2 𝑥 + 3𝑦 + 6𝑧 = 12
𝑦−0 = 2 𝑥 + 6 + 0 = 12
𝑦=2 𝑥=6

To check (using equation 1):

𝑥 + 3𝑦 + 6𝑧 = 12
6 + 3(2) + 6(0) = 12
6 + 6 + 0 = 12
12 = 12
Example 3: Solve the following system of equations: 3𝑥 − 2𝑦 + 𝑧 = 11, 𝑥 − 3𝑦 + 2𝑧 = 11
and 2𝑥 + 𝑦 − 4𝑧 = −9 using upper triangular form. Use the two methods.
Solution:

Method 1:
Rearrange the three equations:
𝑥 − 3𝑦 + 2𝑧 = 11
3𝑥 − 2𝑦 + 𝑧 = 11
2𝑥 + 𝑦 − 4𝑧 = −9
Step 1: Pivot equation = 1st and pivot coefficient = 1
3
𝑚=1=3

(3)(𝑥 − 3𝑦 + 2𝑧 = 11)
3𝑥 − 9𝑦 + 6𝑧 = 33
Subtract to Eqt. 2:
(3𝑥 − 2𝑦 + 𝑧 = 11) − (3𝑥 − 9𝑦 + 6𝑧 = 33)
0𝑥 + 7𝑦 − 5𝑧 = −22

2
𝑚= =2
1

(2)(𝑥 − 3𝑦 + 2𝑧 = 11)
2𝑥 − 6𝑦 + 4𝑧 = 22
Subtract to Eqt. 3:
(2𝑥 + 𝑦 − 4𝑧 = −9) − (2𝑥 − 6𝑦 + 4𝑧 = 22)
0𝑥 + 7𝑦 − 8𝑧 = −31
Then:
𝑥 − 3𝑦 + 2𝑧 = 11
7𝑦 − 5𝑧 = −22
7𝑦 − 8𝑧 = −31
Step 2: Pivot equation = 2nd and pivot coefficient=7
7
𝑚= =1
7

(1)(7𝑦 − 5𝑧 = −22)
7𝑦 − 5𝑧 = −22
Subtract to Eqt. 3:
(7𝑦 − 8𝑧 = −31 ) − (7𝑦 − 5𝑧 = −22)
0𝑦 − 3𝑧 = −9
Then:
𝑥 − 3𝑦 + 2𝑧 = 11
7𝑦 − 5𝑧 = −22
−3𝑧 = −9
Then, by back substitution:
 for 𝑧:
−3𝑧 = −9
−9
𝑧= =𝟑
−3
for 𝑦:
7𝑦 − 5𝑧 = −22
−22+5𝑧
𝑦=
7
−22+5(3)
𝑦= = −𝟏
7
for 𝑥:
𝑥 − 3𝑦 + 2𝑧 = 11
𝑥 = 11 + 3𝑦 − 2𝑧
𝑥 = 11 + 3(−1) − 2(3) = 𝟐
Method 2:
Given system of equations are:
3𝑥 − 2𝑦 + 𝑧 = 11
𝑥 − 3𝑦 + 2𝑧 = 11
2𝑥 + 𝑦 − 4𝑧 = −9
The augmented matrix:
3 −2 1 11
[1 −3 2 | 11 ]
2 1 −4 −9
Rearrange the three equations:
1 −3 2 11
[3 −2 1 | 11 ]
2 1 −4 −9
Using upper ∆ matrix:
𝑅2 → 𝑅2 − 3𝑅1 and 𝑅3 → 𝑅3 − 2𝑅1
1 −3 2 11
[0 7 −5|−22]
0 7 −8 −31
𝑅3 → 𝑅3 − 𝑅2
1 −3 2 11
[0 7 −5|−22]
0 0 −3 −9
Then:
for z: for y: for x:
−3𝑧 = −9 7𝑦 − 5𝑧 = −22 𝑥 − 3𝑦 + 2𝑧 = 11
𝑧=3 7𝑦 − 5(3) = −22 𝑥 + 3 + 6 = 11
7𝑦 = −7 𝑥=2
𝑦 = −1
_____________________________________________

References/Additional Resources/Readings

S. Chapra & R. Canale (2010). Numerical Methods for Engineers, 7th ed., McGraw-Hill
Education, Inc.

J. Epperson (2013). An Introduction to Numerical Methods and Analysis, 2nd ed., John Wiley
& Sons, Inc.

J. Chasnov (nd). Numerical Methods, The Hong Kong University of Science and Technology.

https://nm.mathforcollege.com/chapter-01.02-measuring-errors/

https://www.cuemath.com/algebra/simultaneous-equations/
Assignment
ASSIGNMENT 4

Name: ______________________Course/Year/Section: ___________ Score: _________

Gauss Elimination Method Problems

1.) Solve the following system of equations using upper triangular form and lower
triangular form.
𝑥 + 𝑦 + 𝑧 = 9
2𝑥 + 5𝑦 + 7𝑧 = 52
2𝑥 + 𝑦 – 𝑧 = 0

2.) Solve the following linear system using upper triangular form.
4𝑥 – 5𝑦 = −6
2𝑥 – 2𝑦 = 1
Learner’s Feedback Form

Name of Student: ___________________________________________________

Program : ___________________________________________________
Year Level : ___________ Section: ____________
Faculty : ___________________________________________________
Schedule : ___________________________________________________

Learning Module : Number: _________ Title : ______________________

How do you feel about the topic or concept presented?

□ I completely get it. □ I’m struggling.
□ I’ve almost got it. □ I’m lost.

In what particular portion of this learning packet, you feel that you are struggling or lost?
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________

Did you raise your concern to you instructor? □ Yes □ No

If Yes, what did he/she do to help you?

___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________

If No, state your reason?

___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________

To further improve this learning packet, what part do you think should be enhanced?
___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________

How do you want it to be enhanced?

___________________________________________________________________________
___________________________________________________________________________
___________________________________________________________________________

NOTE: This is an essential part of course module. This must be submitted to the subject
teacher (within the 1st week of the class).