06.09.2021 Views

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

352 Spectral Theory<br />

Through us<strong>in</strong>g elementary matrices, we were able to create a matrix for which f<strong>in</strong>d<strong>in</strong>g the eigenvalues<br />

was easier than for A. At this po<strong>in</strong>t, you could go back to the orig<strong>in</strong>al matrix A and solve (λI − A)X = 0<br />

to obta<strong>in</strong> the eigenvectors of A.<br />

Notice that when you multiply on the right by an elementary matrix, you are do<strong>in</strong>g the column operation<br />

def<strong>in</strong>ed by the elementary matrix. In 7.4 multiplication by the elementary matrix on the right<br />

merely <strong>in</strong>volves tak<strong>in</strong>g three times the first column and add<strong>in</strong>g to the second. Thus, without referr<strong>in</strong>g to<br />

the elementary matrices, the transition to the new matrix <strong>in</strong> 7.4 can be illustrated by<br />

⎡<br />

⎣<br />

33 −105 105<br />

10 −32 30<br />

0 0 −2<br />

⎤<br />

⎡<br />

⎦ → ⎣<br />

3 −9 15<br />

10 −32 30<br />

0 0 −2<br />

⎤<br />

⎡<br />

⎦ → ⎣<br />

3 0 15<br />

10 −2 30<br />

0 0 −2<br />

The third special type of matrix we will consider <strong>in</strong> this section is the triangular matrix. Recall Def<strong>in</strong>ition<br />

3.12 which states that an upper (lower) triangular matrix conta<strong>in</strong>s all zeros below (above) the ma<strong>in</strong><br />

diagonal. Remember that f<strong>in</strong>d<strong>in</strong>g the determ<strong>in</strong>ant of a triangular matrix is a simple procedure of tak<strong>in</strong>g<br />

the product of the entries on the ma<strong>in</strong> diagonal.. It turns out that there is also a simple way to f<strong>in</strong>d the<br />

eigenvalues of a triangular matrix.<br />

In the next example we will demonstrate that the eigenvalues of a triangular matrix are the entries on<br />

the ma<strong>in</strong> diagonal.<br />

Example 7.12: Eigenvalues for a Triangular Matrix<br />

⎡<br />

1 2<br />

⎤<br />

4<br />

Let A = ⎣ 0 4 7 ⎦. F<strong>in</strong>d the eigenvalues of A.<br />

0 0 6<br />

⎤<br />

⎦<br />

Solution. We need to solve the equation det(xI − A)=0 as follows<br />

⎡<br />

x − 1 −2 −4<br />

⎤<br />

det(xI − A)=det⎣<br />

0 x − 4 −7 ⎦ =(x − 1)(x − 4)(x − 6)=0<br />

0 0 x − 6<br />

Solv<strong>in</strong>g the equation (x − 1)(x − 4)(x − 6) =0forx results <strong>in</strong> the eigenvalues λ 1 = 1,λ 2 = 4and<br />

λ 3 = 6. Thus the eigenvalues are the entries on the ma<strong>in</strong> diagonal of the orig<strong>in</strong>al matrix.<br />

♠<br />

The same result is true for lower triangular matrices. For any triangular matrix, the eigenvalues are<br />

equal to the entries on the ma<strong>in</strong> diagonal. To f<strong>in</strong>d the eigenvectors of a triangular matrix, we use the usual<br />

procedure.<br />

In the next section, we explore an important process <strong>in</strong>volv<strong>in</strong>g the eigenvalues and eigenvectors of a<br />

matrix.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!