MATH 323 Lecture 26

From Notes
Jump to navigation Jump to search

« previous | "Thursday", November 4, 2012 | next »


Theorem 6.3.1

If λ1,,λk are distinct eigenvalues of an n×n matrix A with corresponding eigenvectors x1,,xk, then x1,,x2 are linearly independent.

V=Span{x1,,xk}dimV=r


Diagonalization

A is said to be diagonalizable if there is a nonsingular matrix X with

X1AX=D=(λ100λn)

where D is a diagonal matrix.

Therefore AD by A=XDX1.

Theorem 6.3.2

An n×n matrix A is diagonalizable iff A has n linearly independent eigenvectors.

A:x1,,xnlinearly independent eigenvectorsλ1,,λneigenvalues (not necessarily distinct)X=(x1,,xn)D=[λ100λn]

Corollary

  1. If A is diagonalizable and A=XDX1, then diagonal entries of D are eigenvalues of A.
  2. X=(x1,,xn), but X is not unique.
  3. If eigenvalues are distinct, then A is diagonalizable
  4. If they are not distinct, then A may or may not be diagonalizable
  5. If A=XDX1, then Ak=XDkX1=X(λ1k00λnk)X1.


Example

A=[2325]λ1=1λ2=4x1=3,1x2=1,2X=(3112)X1AX=D=(1004)=15[2113][2325][3112]


Matrix Exponential

ex=n=01n!xn is a very important function.

We similarily define eA for a matrix A to be

eA=n=01n!An

If A is diagonalizable, then eA=XeDX1, where eD is given by

eD=[eλ100eλn]


Example

A=[2613]=[2311][1000][1312]

eA=[2311][e001][1312]=[32e66ee13e2]

Application: Differential Equation

Solution to differential equation y=ay is y=eaty0.

Similarly, the system of differential equations Y=AY has the solution Y=etAY0.


Final Exam Review

5 problems and an 11-point bonus problem

  • Linear transformations (Null Space, Range, Basis)
  • Orthogonality
  • Orthogonalization (Gram-Schmidt process, QR factorization)
  • Eigenvalues and Eigenvectors
  • Least Squares Problems


Note on Factoring Cubics

For a cubic polynomial p(λ)=aλ3+bλ2+cλ+d, if p(m)=0 for m, m divides d:

p(λ)=aλ3+bλ2+cλ+d=(αλ2+βλ+γ)(λm)