SOLUTIONS OF LINEAR SYSTEMS

Numerical Solutions to CE Problems

 Rank of a Matrix
The rank of a matrix A is the maximum number of linearly independent
rows: in other words, the maximum number of unique rows that are not
made of other rows.

For a m x n matrix,
• If m is less than n, then the maximum rank of the matrix is m.
• If m is greater than n, then the maximum rank of the matrix is n.
• The rank of matrix would be zero only if the matrix had no elements.
• If a matrix had even one element, its minimum rank would be one.
 Rank of a Matrix
2 METHODS
By inspection

By transforming into row echelon form

Sample Problems:
Determine the rank of the following matrices by INSPECTION.

3 1 5
1.
6 2 10

2.
2 1 6
3 5 7
5 6 13

3. 0 5 3
1 2 1
2 3 4
Sample Problems:
Determine the rank of the following matrices by INSPECTION.

3 1 5
1. Rank 1
6 2 10

2.
2 1 6
3 5 7
5 6 13

3. 0 5 3
1 2 1
2 3 4
Sample Problems:
Determine the rank of the following matrices by INSPECTION.

3 1 5
1. Rank 1
6 2 10

2.
2 1 6 Rank 2
3 5 7
5 6 13

3. 0 5 3
1 2 1
2 3 4
Sample Problems:
Determine the rank of the following matrices by INSPECTION.

3 1 5
1. Rank 1
6 2 10

2.
2 1 6 Rank 2
3 5 7
5 6 13

3. 0 5 3
Rank 3
1 2 1
2 3 4
Determining the rank of a matrix using ROW ECHELON FORM
The maximum number of linearly independent rows in a matrix is equal to the
number of non-zero rows on its row echelon matrix.

𝑎 𝑏 𝑐 𝑎 𝑏 𝑐
𝐴= 0 𝑑 𝑒 or B = 0 𝑑 𝑒
0 0 𝑓 0 0 0

A m x n matrix is in echelon form if:

1. All rows consisting of only zeroes are at the bottom.
2. The leading coefficient (also known as the pivot) of a nonzero row is in a column to the
right of the leading entry of the row above it.
3. All entries of a column below a leading entry are zeros.
Determining the rank of a matrix using ROW ECHELON FORM
You can do the following steps in transformation:
Given: 𝑎11 𝑎12 𝑎13
𝐴 = 𝑎21 𝑎22 𝑎23
𝑎31 𝑎32 𝑎33

1. Interchanging two rows

𝑎31 𝑎32 𝑎33
𝐴 = 𝑎21 𝑎22 𝑎23 R1↔R3
𝑎11 𝑎12 𝑎13

2. Multiplying a row by a non-zero numbers

𝑎11 𝑎12 𝑎13
ൗ3 ൗ3 ൗ3
𝐴 = 3𝑎21ൗ 3𝑎22ൗ 3𝑎23ൗ R1’= R1 /3 R2’= 3R2/4 R3’= 2R3
4 4 4
2𝑎31 2𝑎32 2𝑎33

3. Adding a number times the element of the row elements of another row
𝑎11 − 𝑎21 𝑎12 − 𝑎22 𝑎13 − 𝑎23
𝐴= 𝑎21 𝑎22 𝑎23 R1’= R1 – R2 R3’= 2R3 – 4R2
2𝑎31 − 4𝑎21 2𝑎32 − 4𝑎21 2𝑎33 − 4𝑎21
Sample Problems:
Determine the rank of the following matrices by transforming into its
ROW ECHELON FORM.
3 1 5
1.
6 2 10

2.
2 1 6
3 5 7
5 6 13

3. 0 5 3
1 2 1
2 3 4
Sample Problems:
Determine the rank of the following matrices by transforming into its
ROW ECHELON FORM.
3 1 5 3 1 5 Rank 1
1.
6 2 10 0 0 0

2.
2 1 6
3 5 7
5 6 13

3. 0 5 3
1 2 1
2 3 4
Sample Problems:
Determine the rank of the following matrices by transforming into its
ROW ECHELON FORM.
3 1 5 3 1 5 Rank 1
1.
6 2 10 0 0 0

2.
2 1 6 2 1 6
3 5 7 0 7 −4 Rank 2
5 6 13 0 0 0

3. 0 5 3
1 2 1
2 3 4
Sample Problems:
Determine the rank of the following matrices by transforming into its
ROW ECHELON FORM.
3 1 5 3 1 5 Rank 1
1.
6 2 10 0 0 0

2.
2 1 6 2 1 6
3 5 7 0 7 −4 Rank 2
5 6 13 0 0 0

3. 0 5 3 1 2 1
1 2 1 0 5 3 Rank 3
2 3 4 0 0 13ൗ5
SOLUTIONS OF LINEAR SYSTEMS
A matrix can serve as a device for representing and solving a system of equations. Given a system of
linear equation:
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + 𝑎23 𝑥3 = 𝑏2
…
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + 𝑎𝑚3 𝑥3 = 𝑏𝑚

There are two ways to express a system in matrix form:

1. Augmented Matrix- a matrix derived from a system of linear equations each written in standard form
with the constant term on the right side

𝑎11 𝑎12 … 𝑎1𝑛 : 𝑏1

𝑎21 𝑎22 … 𝑎2𝑛 ∶ 𝑏2
⋮ ⋮ 𝑎𝑖𝑗 ⋮ : ⋮
𝑎𝑚1 𝑎𝑚2 … 𝑎𝑚𝑛 ∶ 𝑏𝑚

2. Coefficient Matrix- a matrix derived from a system of linear equation written in standard form which
does not include constant terms.

𝑎11 𝑎12 … 𝑎1𝑛

𝑎21 𝑎22 … 𝑎2𝑛
⋮ ⋮ 𝑎𝑖𝑗 ⋮
𝑎𝑚1 𝑎𝑚2 … 𝑎𝑚𝑛
SOLUTIONS OF LINEAR SYSTEMS

The rank of the augmented and coefficient matrix gives a complete

information about existences, uniqueness and general structure of the
solution set of linear systems as follows:

 A linear system of equation in n unknowns has a unique solution if the

coefficient matrix and the augmented matrix have the same rank n.

 The system has an infinitely many solutions if the common rank of the
coefficient matrix and the augmented matrix is less than n.

 The system has no solution if those two matrices have different rank.
Sample Problems:
Describe the solution set of the following linear system:

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏

1. 𝒙 − 𝟑𝒚 + 𝟐𝒛 = 𝟑
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏
2.
𝟔𝒙 + 𝟒𝒚 − 𝟖𝒛 = 𝟐
𝟗𝒙 + 𝟔𝒚 − 𝟏𝟐𝒛 = 𝟑

3. 𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏
𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟑
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Sample Problems:
Describe the solution set of the following linear system:

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏 Augmented Matrix = Rank 3

𝒙 − 𝟑𝒚 + 𝟐𝒛 = 𝟑 Coefficient Matrix = Rank 3
1.
3 (rank) = 3 (unknowns)
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Therefore, UNIQUE SOLUTION

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏
2.
𝟔𝒙 + 𝟒𝒚 − 𝟖𝒛 = 𝟐
𝟗𝒙 + 𝟔𝒚 − 𝟏𝟐𝒛 = 𝟑

3. 𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏
𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟑
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Sample Problems:
Describe the solution set of the following linear system:

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏 Augmented Matrix = Rank 3

𝒙 − 𝟑𝒚 + 𝟐𝒛 = 𝟑 Coefficient Matrix = Rank 3
1.
3 (rank) = 3 (unknowns)
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Therefore, UNIQUE SOLUTION

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏 Augmented Matrix = Rank 1

2.
Coefficient Matrix = Rank 1
𝟔𝒙 + 𝟒𝒚 − 𝟖𝒛 = 𝟐
1 (rank) < 3 (unknowns)
𝟗𝒙 + 𝟔𝒚 − 𝟏𝟐𝒛 = 𝟑
Therefore, INFINITELY MANY SOLUTIONS

3. 𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏
𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟑
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Sample Problems:
Describe the solution set of the following linear system:

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏 Augmented Matrix = Rank 3

𝒙 − 𝟑𝒚 + 𝟐𝒛 = 𝟑 Coefficient Matrix = Rank 3
1.
3 (rank) = 3 (unknowns)
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Therefore, UNIQUE SOLUTION

𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏 Augmented Matrix = Rank 1

2.
Coefficient Matrix = Rank 1
𝟔𝒙 + 𝟒𝒚 − 𝟖𝒛 = 𝟐
1 (rank) < 3 (unknowns)
𝟗𝒙 + 𝟔𝒚 − 𝟏𝟐𝒛 = 𝟑
Therefore, INFINITELY MANY SOLUTIONS

3. 𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟏 Augmented Matrix = Rank 3

Coefficient Matrix = Rank 2
𝟑𝒙 + 𝟐𝒚 − 𝟒𝒛 = 𝟑
3 (rank) ≠ 2 (rank)
𝟐𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟑
Therefore, NO SOLUTION
SOLUTIONS OF LINEAR SYSTEMS

1st Method: Cramer’s Rule

It is a way of solving linear equations using determinants. It says that:

𝑫𝒙1 𝑫𝒙2 𝑫𝒙𝒊

𝒙1 = ; 𝒙2 = ; … 𝒙𝒊 =
𝑫 𝑫 𝑫

D = determinants of the coefficients of the variables

Dx = determinants taken from D, replacing the coefficients of xi with the corresponding constant
i
terms
Sample Problems:
Solve for the unknown variables of the linear system using CRAMER’S RULE.
𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐
1.
𝟑𝒙 + 𝟐𝒚 = 𝟑

𝟑𝒚 + 𝟒𝒛 = 𝟏𝟐
2.
𝒙 − 𝟐𝒛 = −𝟏𝟎
𝟒𝒙 + 𝟓𝒚 = −𝟏𝟐

3. 𝟕𝒘 − 𝟑𝒙 + 𝟒𝒚 = 𝟏
𝟖𝒙 − 𝟑𝒚 + 𝟒𝒛 = −𝟕
𝒘 − 𝟓𝒙 − 𝟏𝟎𝒚 + 𝒛 = 𝟒𝟏
𝟐𝒘 + 𝒙 + 𝟑𝒛 = 𝟎
Sample Problems:
Solve for the unknown variables of the linear system using CRAMER’S RULE.

1.
𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐 x=5, y=-6
𝟑𝒙 + 𝟐𝒚 = 𝟑

𝟑𝒚 + 𝟒𝒛 = 𝟏𝟐
2.
𝒙 − 𝟐𝒛 = −𝟏𝟎
𝟒𝒙 + 𝟓𝒚 = −𝟏𝟐

3. 𝟕𝒘 − 𝟑𝒙 + 𝟒𝒚 = 𝟏
𝟖𝒙 − 𝟑𝒚 + 𝟒𝒛 = −𝟕
𝒘 − 𝟓𝒙 − 𝟏𝟎𝒚 + 𝒛 = 𝟒𝟏
𝟐𝒘 + 𝒙 + 𝟑𝒛 = 𝟎
Sample Problems:
Solve for the unknown variables of the linear system using CRAMER’S RULE.

1.
𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐 x=5, y=-6
𝟑𝒙 + 𝟐𝒚 = 𝟑

𝟑𝒚 + 𝟒𝒛 = 𝟏𝟐
2. x=2, y=-4, z=6
𝒙 − 𝟐𝒛 = −𝟏𝟎
𝟒𝒙 + 𝟓𝒚 = −𝟏𝟐

3. 𝟕𝒘 − 𝟑𝒙 + 𝟒𝒚 = 𝟏
𝟖𝒙 − 𝟑𝒚 + 𝟒𝒛 = −𝟕
𝒘 − 𝟓𝒙 − 𝟏𝟎𝒚 + 𝒛 = 𝟒𝟏
𝟐𝒘 + 𝒙 + 𝟑𝒛 = 𝟎
Sample Problems:
Solve for the unknown variables of the linear system using CRAMER’S RULE.

1.
𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐 x=5, y=-6
𝟑𝒙 + 𝟐𝒚 = 𝟑

𝟑𝒚 + 𝟒𝒛 = 𝟏𝟐
2. x=2, y=-4, z=6
𝒙 − 𝟐𝒛 = −𝟏𝟎
𝟒𝒙 + 𝟓𝒚 = −𝟏𝟐

3. 𝟕𝒘 − 𝟑𝒙 + 𝟒𝒚 = 𝟏 w=1, x=-2, y=-3, z=0

𝟖𝒙 − 𝟑𝒚 + 𝟒𝒛 = −𝟕
𝒘 − 𝟓𝒙 − 𝟏𝟎𝒚 + 𝒛 = 𝟒𝟏
𝟐𝒘 + 𝒙 + 𝟑𝒛 = 𝟎
SOLUTIONS OF LINEAR SYSTEMS

2nd Method: Gauss-Jordan Elimination Method

It transforms the augmented matrix [A: B] into its reduced echelon form by using
elementary row operations.
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + 𝑎23 𝑥3 = 𝑏2
…
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + 𝑎𝑚3 𝑥3 = 𝑏𝑚
Steps:
1. Write the augmented matrix of the system.

2. Use row operations to transform the augmented matrix in reduced row echelon form as shown
below.
Reduced row echelon form has the following criteria:
1 0 … 0 : 𝑎
0 1 … 0 ∶ 𝑏 a. It is in row echelon form.

⋮ ⋮ … ⋮ ∶ ⋮ b. The leading entry in each non-zero row is 1.

c. Each column containing a leading 1 has zeros in all of its other
0 0 … 1 ∶ 𝑧 entries.
Sample Problems:
Solve for the unknown variables of the linear system using GAUSS-JORDAN ELIMINATION METHOD.

1.
𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐 x=5, y=-6
𝟑𝒙 + 𝟐𝒚 = 𝟑

𝟑𝒚 + 𝟒𝒛 = 𝟏𝟐
2. x=2, y=-4, z=6
𝒙 − 𝟐𝒛 = −𝟏𝟎
𝟒𝒙 + 𝟓𝒚 = −𝟏𝟐

3. 𝟕𝒘 − 𝟑𝒙 + 𝟒𝒚 = 𝟏 w=1, x=-2, y=-3, z=0

𝟖𝒙 − 𝟑𝒚 + 𝟒𝒛 = −𝟕
𝒘 − 𝟓𝒙 − 𝟏𝟎𝒚 + 𝒛 = 𝟒𝟏
𝟐𝒘 + 𝒙 + 𝟑𝒛 = 𝟎
SOLUTIONS OF LINEAR SYSTEMS

3RD Method: Gauss-Seidel Method

It is a specific iterative method that is always using the latest estimated value for each element in x.

Steps:

1. Given n equation, determine if your system is strictly diagonally dominant. This means that for all rows, the absolute value of the
diagonal element in a row is strictly greater than or equal to the sum of absolute value of the rest of the elements in that row.
2. Isolate the variable of the diagonal element on the left side of the equation.
3. Assume that the solution of given equation is:
(0, 0, ..., 0)
4. We put the value of σ𝑛𝑖=2 𝑥𝑖 in the first equation and get the value of x1 and update the value of x1 as:
(x1, 0, …, 0)
5. Putting the updated value of x1 and assumed value of σ𝑛𝑖=3 𝑥𝑖 in equation 2 to get x2 and their updated solution as:
(x1, x2, …, 0)
6. Continue getting the value of the remaining variables using the updated preceding values until we get the value of xn and their updated
solution as:
(x1, x2, …, xn)
7. Repeat the same process from step 3 to get the approximate solution with minimum error. The minimum error can be computed as:
𝑒𝑟𝑟𝑜𝑟 = 𝑥𝑝𝑟𝑒𝑣𝑖𝑜𝑢𝑠 − 𝑥𝑢𝑝𝑑𝑎𝑡𝑒𝑑
Sample Problems:
Solve for the unknown variables of the linear system using GAUSS-SEIDEL METHOD.
The allowable error is 0.0001.

𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐
1.
𝟑𝒙 + 𝟐𝒚 = 𝟑
Sample Problems:
Solve for the unknown variables of the linear system using GAUSS-SEIDEL METHOD.
The allowable error is 0.0001.

iteration x x/error y y/error

𝟒𝒙 − 𝟕𝒚 = 𝟔𝟐
1. 1 0.0000 - 0.0000 -
𝟑𝒙 + 𝟐𝒚 = 𝟑 2 1.0000 1.0000 -8.2857 8.2857
3 6.5238 5.5238 -5.1293 3.1564
4 4.4195 2.1043 -6.3317 1.2024
5 5.2211 0.8016 -5.8737 0.4580
6 4.9158 0.3053 -6.0481 0.1744
7 5.0321 0.1163 -5.9817 0.0664
8 4.9878 0.0443 -6.0070 0.0253
9 5.0047 0.0169 -5.9973 0.0097
10 4.9982 0.0065 -6.0010 0.0037
11 5.0007 0.0025 -5.9996 0.0014
12 4.9997 0.0010 -6.0002 0.0006
13 5.0001 0.0004 -5.9999 0.0003
14 x=5
4.9999 0.0002 y=-6
-6.0001 0.0002
Sample Problems:
Solve for the unknown variables of the linear system using GAUSS-SEIDEL METHOD.
The allowable error is 0.0001.

2. 𝟑𝒚 + 𝟒𝒛 = 𝟏𝟐
𝒙 − 𝟐𝒛 = −𝟏𝟎
𝟒𝒙 + 𝟓𝒚 = −𝟏𝟐

Rearranging rows does not make the system strictly diagonally dominant.

Therefore, Gauss-Seidel method is not applicable in solving this system.

Sample Problems:
Solve for the unknown variables of the linear system using GAUSS-SEIDEL METHOD.
The allowable error is 0.0001.
# w w/error x x/error y y/error z z/error

𝟕𝒘 − 𝟑𝒙 + 𝟒𝒚 = 𝟏 1 0.0000 - 0.0000 0.0000 0.0000

3. 2 0.1429 0.1429 -0.8750 0.8750 -3.6482 3.6482 0.1964 0.1964

𝟖𝒙 − 𝟑𝒚 + 𝟒𝒛 = −𝟕 3 1.8525 1.7096 -2.3413 1.4663 -2.7245 0.9237 -0.4546 0.6510

4 0.6963 1.1562 -1.6694 0.6719 -3.2411 0.5166 0.0923 0.5469

𝒘 − 𝟓𝒙 − 𝟏𝟎𝒚 + 𝒛 = 𝟒𝟏 5 1.2795 0.5832 -2.1366 0.4672 -2.8945 0.3466 -0.1408 0.2331

6 0.8812 0.3983 -1.8900 0.2466 -3.0810 0.1865 0.0425 0.1833

𝟐𝒘 + 𝒙 + 𝟑𝒛 = 𝟎 7 1.0934 0.2122 -2.0516 0.1616 -2.9606 0.1204 -0.0451 0.0876

8 0.9554 0.1380 -1.9627 0.0889 -3.0276 0.0670 0.0173 0.0624

9 1.0318 0.0764 -2.0190 0.0563 -2.9856 0.0420 -0.0149 0.0322

10 0.9836 0.0482 -1.9872 0.0318 -3.0095 0.0239 0.0067 0.0216

11 1.0109 0.0273 -2.0069 0.0197 -2.9948 0.0147 -0.0050 0.0117

12 0.9941 0.0168 -1.9956 0.0113 -3.0033 0.0085 0.0025 0.0075

13 1.0038 0.0097 -2.0025 0.0069 -2.9981 0.0052 -0.0017 0.0042

14 0.9978 0.0060 -1.9984 0.0041 -3.0012 0.0031 0.0009 0.0026

15 1.0014 0.0036 -2.0009 0.0025 -2.9993 0.0019 -0.0006 0.0015

16 0.9992 0.0022 -1.9994 0.0015 -3.0004 0.0011 0.0003 0.0009

17 1.0005 0.0013 -2.0003 0.0009 -2.9998 0.0006 -0.0002 0.0005

18 0.9998 0.0007 -1.9998 0.0005 -3.0001 0.0003 0.0001 0.0003

19 1.0001 0.0003 -2.0001 0.0003 -2.9999 0.0002 0.0000 0.0001

20 0.9999 0.0002 -2.0000 0.0001 -3.0000 0.0001 0.0001 0.0001

w=1 x=-2 y=-3 z=0

Assignment
#3
Assignment
#3
Any Questions?
Thank You!