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 x→1,…,x→k, then x→1,…,x→2 are linearly independent.

V=Span{x→1,…,x→k}dim⁡V=r


Diagonalization

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

X−1AX=D=(λ1…0⋮⋱⋮0…λn)

where D is a diagonal matrix.

Therefore A∼D by A=XDX−1.

Theorem 6.3.2

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

A:x→1,…,x→nlinearly independent eigenvectorsλ1,…,λneigenvalues (not necessarily distinct)X=(x→1,…,x→n)D=[λ1…0⋮⋱⋮0…λn]

Corollary

  1. If A is diagonalizable and A=XDX−1, then diagonal entries of D are eigenvalues of A.
  2. X=(x→1,…,x→n), 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=XDX−1, then Ak=XDkX−1=X(λ1k…0⋮⋱⋮0…λnk)X−1.


Example

A=[2−32−5]λ1=1λ2=−4x→1=⟨3,1⟩x→2=⟨1,2⟩X=(3112)X−1AX=D=(100−4)=15[2−1−13][2−32−5][3112]


Matrix Exponential

ex=∑n=0∞1n!xn is a very important function.

We similarily define eA for a matrix A to be

eA=∑n=0∞1n!An

If A is diagonalizable, then eA=XeDX−1, where eD is given by

eD=[eλ1…0⋮⋱⋮0…eλn]


Example

A=[−2−613]=[−2−311][1000][13−1−2]

eA=[−2−311][e001][13−1−2]=[3−2e6−6ee−13e−2]

Application: Differential Equation

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

Similarly, the system of differential equations Y→′=AY→ has the solution Y→=etAY→0.


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)