Scribd
Upload
60 views4 pages

Zeros Below The Diagonal: Row I Column I I N

1. The document describes a matrix method for solving systems of linear equations. 2. It involves writing the augmented matrix of the system and performing row operations to put it in reduced row echelon form. 3. If the reduced matrix has zeros below the diagonal and non-zero entries on the diagonal, the system has a unique solution. If any diagonal entry is zero, the system may have no solution or infinitely many solutions.

Uploaded by

রোদেলাদুপুরেরফুল
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views4 pages

Zeros Below The Diagonal: Row I Column I I N

1. The document describes a matrix method for solving systems of linear equations. 2. It involves writing the augmented matrix of the system and performing row operations to put it in reduced row echelon form. 3. If the reduced matrix has zeros below the diagonal and non-zero entries on the diagonal, the system has a unique solution. If any diagonal entry is zero, the system may have no solution or infinitely many solutions.

Uploaded by

রোদেলাদুপুরেরফুল
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

A Matrix Method to Solve a System of n Linear

Equations in n unknowns:

1. Write the augmented matrix that represents the


system.

2. Perform row operations to simplify the augmented


matrix to one having zeros below the diagonal of
the coefficient portion of the matrix.

(An entry is on the diagonal of the coefficient


portion of the matrix if it is located in row i and
column i for some positive integer i ≤ n.)
If the augmented matrix is equivalent to a matrix
with zeros below the diagonal and all non-zero
entries on the diagonal, then the corresponding
system has a unique solution.

If the aumented matrix is equivalent to a matrix


with zeros below the diagonal and at least one
zero on the diagonal, then the corresponding
system does not have a unique solution.

In this case, examination of the rows which contain


a zero on the diagonal entry will determine
whether the corresponding system has no solution
or an infinite number of solutions.
Examples:
The system of equations represented by the following
augmented matrices have a unique solution:
2 3 4 11  2 3 4 0  1 0 0 −2 
0 −1 3 10  , 0 −1 2 1  , 0 1 0 3 
     
0 0 −2 −6 0 0 −1 0  0 0 1 0 

The system of equations represented by the following


augmented matrix has no solution:
2 3 4 11 
0 −1 3 10 
 
0 0 0 −6

(Note that the third row of the above matrix represents


the equation: 0x + 0y + 0z = -6 or 0 = -6 which is not
a true statement. Therefore the corresponding system
has no solution.)

The system of equations represented by the following


augmented matrix has an infinite number of
solutions:
2 3 4 11
0 −1 3 10 
 
0 0 0 0 

(Note that the third row of the above matrix represents


the equation: 0x + 0y + 0z = 0 or 0 = 0 which is a
true for any values x,y and z.)
Use matrices to solve the following system of
equations:
x + 3y - z = - 3
3x - y + 2z = 1
2x - y + z = -1
The augmented matrix corresponding to the above
system of equations is:
1 3 −1 −3
3 −1 2 1 
 
2 −1 1 −1
Our strategy is to use elementary row operations to
zero out the entries in: Row 2 and Column 1
Row 3 and Column 1
Row 3 and Column 2.
Hint 1:
One way to zero out the entry in row 2, column 1 is:
1 3 −1 −3 −3 −9 3 9  −3 −9 3 9  1 1 3 −1 −3
R1 − r1
3 −1 2 1  R → 3 −1 2 1  → 0 −10 5 10  → 0 −10 5 10 
1 = −3 r1   R2 = r1 + r2   3 
       
2 −1 1 −1  2 −1 1 −1  2 −1 1 −1 2 −1 1 −1

A more efficient way is:

1 3 −1 −3 1 3 −1 −3
3 −1 2 1  R → 0 −10 5 10 
2 =−3 r1 + r2

   
2 −1 1 −1 2 −1 1 −1
−3r1: −3 −9 3 9
“Scratch” for the above operation: r2 : 3 −1 2 1
_____________________

R2 : 0 −10 5 10
Hint 2:
When all entries of a row have a common factor, consider dividing each term in that
row by the common factor. If you can reduce the magnitude of the entries in a row
without introducing fractions, your subsequent calculations will involve smaller
numbers.

1 3 −1 −3 1 1 3 −1 −3
0 −10 5 10  5
→ 0 −2 1 2 
R2

   
2 −1 1 −1 2 −1 1 −1
Next, zero out the entry in row 3, column 1:

1 3 −1 −3 1 3 −1 −3
0 −2 1 2  R → 0 −2 1 2 
3 =−2 r1 + r3

   
2 −1 1 −1 0 −7 3 5 
AFTER zeroing out the necessary entries in column one, USE ROW 2 to zero
out the necessary entry in column 2, which is, the entry in row 3, column 2.

1 3 −1 −3 1 3 −1 −3
0 −2 1 2    → 0
R3 = −7 r2 + 2 r3
−2 1 2
   
0 −7 3 5  0 0 −1 −4 
At this point, we know that the given system of equations has a unique solution.

Use back substitution to determine the solution:

Converting each row into its equivalent equation form,

-4
from R3 : - z = -4 ⇒ z = ⇒z=4
-1

from R2 : - 2y +1(4) = 2 ⇒ -2y = -2 ⇒ y = 1

from R1: x + 3(1) - (4) = -3 ⇒ x -1 = -3 ⇒ x = -2 .


So the solution is: x = - 2, y = 1, z = 4.

You might also like