Supplementary Notes - Matrices and Linear Equations | MATH 229, Study notes of Linear Algebra

Material Type: Notes; Professor: Bates; Class: Matrices and Linear Equations; Subject: Mathematics; University: Colorado State University; Term: Fall 2008;

Typology: Study notes

Pre 2010

Uploaded on 03/10/2009

koofers-user-43j
koofers-user-43j 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Supplementary notes for Math 229
Dan Bates
Tuesday, Sept. 2
I ran short on time in class today and had to cut a couple of examples down to the bare
minimum. Here are the details on those two topics.
Nonnumerical matrices
You can apply the techniques that we are discussing (like Gaussian elimination to RREF
form) to nonnumerical matrices. In fact, I have heard that these are sometimes on the
tests for 229 (which I don’t get to write). Here is an example:
2x1 2
1 2 x2
1 1 3 x
R1R2
1 2 x2
2x1 0
1 1 3 x
At this point, it is tempting to do R2(2 x)R1R1to make entry (2,1) zero. In the case
of a numerical matrix, that would be fine. In this case, though, check out what it would do
to column 2, row 2...it would make it even worse (degree 2 instead of degree 1!). Instead, we
follow a slightly different route that will make the entries of row 2 all divisible by the same
polynomial. Luckily, the homework problem is a bit more clear.
R2R1R2
1 2 x2
1x x 1 0
1 1 3 x
R3R1R3
1 2 x2
1x x 1 0
0x1 1 x
Now I can divide the second and third rows by x1 to make them nice numbers:
1
x1R2R2
1 2 x2
11 0
0x1 1 x
1
x1R3R3
1 2 x2
11 0
0 1 1
WARNING: We multiplied by 1
x1. If x= 1, this amounts to division by 0 bad news!
SO, the solution that we get here will be valid for x6= 1, and we will need to do the x= 1
case separately.
R2R1R2
1 2 x2
13 + x2
0 1 1
R2R3
13 + x2
1 2 x2
0 1 1
R3(x3)R2R3
1 2 x2
13 + x2
0 0 x5
1
x5R3R3
1 2 x2
13 + x2
0 0 1
WARNING: We did it again! We now need to do the case of x= 5 separately, too.
pf2

Partial preview of the text

Download Supplementary Notes - Matrices and Linear Equations | MATH 229 and more Study notes Linear Algebra in PDF only on Docsity!

Supplementary notes for Math 229 Dan Bates Tuesday, Sept. 2

I ran short on time in class today and had to cut a couple of examples down to the bare minimum. Here are the details on those two topics.

Nonnumerical matrices

You can apply the techniques that we are discussing (like Gaussian elimination to RREF form) to nonnumerical matrices. In fact, I have heard that these are sometimes on the tests for 229 (which I don’t get to write). Here is an example:

 

2 − x 1 2 1 2 − x 2 1 1 3 − x

 R^1 ↔^ R^2

1 2 − x 2 2 − x 1 0 1 1 3 − x

At this point, it is tempting to do R 2 − (2 − x)R 1 → R 1 to make entry (2, 1) zero. In the case of a numerical matrix, that would be fine. In this case, though, check out what it would do to column 2, row 2...it would make it even worse (degree 2 instead of degree 1!). Instead, we follow a slightly different route that will make the entries of row 2 all divisible by the same polynomial. Luckily, the homework problem is a bit more clear.

R 2 − R 1 → R 2

1 2 − x 2 1 − x x − 1 0 1 1 3 − x

 R^3 −^ R^1 →^ R^3

1 2 − x 2 1 − x x − 1 0 0 x − 1 1 − x

Now I can divide the second and third rows by x − 1 to make them nice numbers:

1 x− 1 R^2 →^ R^2 −→

1 2 − x 2 1 − 1 0 0 x − 1 1 − x

1 x− 1 R^3 →^ R^3 −→

1 2 − x 2 1 − 1 0 0 1 − 1

WARNING: We multiplied by (^) x−^11. If x = 1, this amounts to division by 0 – bad news! SO, the solution that we get here will be valid for x 6 = 1, and we will need to do the x = 1 case separately.

R 2 − R 1 → R 2

1 2 − x 2 1 −3 + x − 2 0 1 − 1

 R^2 ↔^ R^3

1 −3 + x − 2 1 2 − x 2 0 1 − 1

R 3 − (x − 3)R 2 → R 3 −→

1 2 − x 2 1 −3 + x − 2 0 0 x − 5

1 x− 5 R^3 →^ R^3 −→

1 2 − x 2 1 −3 + x − 2 0 0 1

WARNING: We did it again! We now need to do the case of x = 5 separately, too.

At this point, the matrix is in REF (not RREF). It is really simple from here to make RREF. I’ll leave it to you, but you should get the identity matrix (1s on the diagonal and 0s everywhere else).

Are we done? Of course not - nobody ever asks that if they are done. We still need to handle the special cases of x = 1 and x = 5. Just plug those into the original matrix and work out the RREF. I won’t type this up since we have been over RREF for numerical matrices, but you should get (for x = 1 and x = 5, respectively):

 (^) and

Generalized augmented matrices

This one is easier. If you need to solve the same system repeatedly (with different right hand sides, a.k.a., constant vectors), you can just toss all of the constant vectors into the augmented matrix.

For example, to solve

2 x + y = 3 x − y = 1

and

2 x + y = 1 x − y = 2

simultaneously, just form the following generalized augmented matrix and follow the steps for RREF as you would for a (normal) augmented matrix.

( 2 1 3 1 1 − 1 1 2

R 1 ↔ R 2

R 2 − 2 R 1 ↔ R 2

3 R^2 ↔^ R^2

R 1 + R 2 ↔ R 1

Thus, as I mentioned briefly in class, the solution to the first system of linear equations is (^43 , 13 ) while the solution to the second system is (1, −1).