Jordan Canonical Form

Similar documents
6 Linear Equation. 6.1 Equation with constant coefficients

Lecture Notes for Math 524

Eigenvalues and Eigenvectors

Periodic Linear Systems

Math Ordinary Differential Equations

and let s calculate the image of some vectors under the transformation T.

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

MA 265 FINAL EXAM Fall 2012

Jordan normal form notes (version date: 11/21/07)

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

0.1 Rational Canonical Forms

Diagonalization of Matrix

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Here is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J

CHAPTER 5 REVIEW. c 1. c 2 can be considered as the coordinates of v

MATRICES ARE SIMILAR TO TRIANGULAR MATRICES

Eigenvalues and Eigenvectors

Math 489AB Exercises for Chapter 2 Fall Section 2.3

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

Linear Algebra- Final Exam Review

Lecture 22: Jordan canonical form of upper-triangular matrices (1)

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

1. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal

Lecture 11: Diagonalization

Modeling and Simulation with ODE for MSE

Linear Algebra: Matrix Eigenvalue Problems

Math 121 Practice Final Solutions

Matrices and Linear Algebra

Examples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling

Definition (T -invariant subspace) Example. Example

Math 3191 Applied Linear Algebra

Chapter 3. Determinants and Eigenvalues

Solution Set 7, Fall '12

LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS

Dimension. Eigenvalue and eigenvector

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

Linear Algebra in Actuarial Science: Slides to the lecture

Econ Slides from Lecture 7

Applied Differential Equation. November 30, 2012

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors

Differential equations

Chapter 6: Orthogonality

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

Eigenvalues and Eigenvectors 7.2 Diagonalization

Lecture 15 Review of Matrix Theory III. Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Elementary linear algebra

Chap 3. Linear Algebra

SYSTEMTEORI - ÖVNING 1. In this exercise, we will learn how to solve the following linear differential equation:

3.3 Eigenvalues and Eigenvectors

Eigenvectors. Prop-Defn

CHAPTER 3. Matrix Eigenvalue Problems

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.

ANSWERS. E k E 2 E 1 A = B

GENERAL ARTICLE Realm of Matrices

Unit 5: Matrix diagonalization

Homework 3 Solutions Math 309, Fall 2015

Math Matrix Algebra

1 Systems of Differential Equations

Eigenvalues and Eigenvectors

Further Mathematical Methods (Linear Algebra) 2002

Linear Algebra II Lecture 22

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

DIAGONALIZATION BY SIMILARITY TRANSFORMATIONS

Linear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems

Lecture Summaries for Linear Algebra M51A

Math 489AB Exercises for Chapter 1 Fall Section 1.0

(a) only (ii) and (iv) (b) only (ii) and (iii) (c) only (i) and (ii) (d) only (iv) (e) only (i) and (iii)

Math 205, Summer I, Week 4b: Continued. Chapter 5, Section 8

The goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto

PROBLEM SET. Problems on Eigenvalues and Diagonalization. Math 3351, Fall Oct. 20, 2010 ANSWERS

Notes on the matrix exponential

Problems in Linear Algebra and Representation Theory

Spring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280

ECEN 605 LINEAR SYSTEMS. Lecture 7 Solution of State Equations 1/77

(VI.D) Generalized Eigenspaces

j=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.

Two Dimensional Linear Systems of ODEs

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

EML Spring 2012

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Lecture 10 - Eigenvalues problem

1. General Vector Spaces

235 Final exam review questions

Therefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.

Differential Equations and Modeling

Eigenvalue and Eigenvector Homework

M.6. Rational canonical form

4. Determinants.

Math Matrix Algebra

Linear Systems and Matrices

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

Jordan Canonical Form

vibrations, light transmission, tuning guitar, design buildings and bridges, washing machine, Partial differential problems, water flow,...

Lecture 8 : Eigenvalues and Eigenvectors

Observability. Dynamic Systems. Lecture 2 Observability. Observability, continuous time: Observability, discrete time: = h (2) (x, u, u)

Chapter 8. Eigenvalues

Transcription:

October 26, 2005 15-1 Jdan Canonical Fm Suppose that A is an n n matrix with characteristic polynomial. p(λ) = (λ λ 1 ) m 1... (λ λ s ) ms and generalized eigenspaces V j = ker(a λ j I) m j. Let L be the linear map defined by Lx = Ax f all x. The space V j is mapped into itself by the linear map defined by L. There is a basis f the space V j such that in that basis the map L has the matrix representation B j = λ j I + N j and N j is a block matrix diag(n j,1,..., N j,dj ) where each N j,k is a square matrix whose only non-zero entries are 1 s on the super-diagonal (i.e., just above the diagonal). The matrix B = diag(b 1,..., B s ) is unique up to a permutation of the B ks N j,ks. This matrix B is called the Jdan canonical fm of the matrix A. If the eigenvalues of A are real, the matrix B can be chosen to be real. If some eigenvalues are complex, then the matrix B will have complex entries. However, if A is real, then the complex eigenvalues come in complex conjugate pairs, and this can be used to give a real Jdan canonical fm. In this fm, if λ j = a j + ib j is a complex eigenvalue of A, then the matrix B j will have the fm B j = D j + N j where D j = diag(e j, E j,..., E j ) and E j is the 2 2 diagonal matrix [ ] aj b j b j a j and N j is a block matrix of the fm diag(n j,1,..., N j,dj ) in which each N j,k is a square matrix whose only non-zero terms lie in blocks of 2 2 identity matrices in the super 2-block diagonal. F instance, in case λ j = 2 + i and λ j = 2 i has multiplicity 4, one can have the following fm f B j.

October 26, 2005 15-2 2 1 1 2 Linear Periodic Systems Consider the homogeneous linear periodic system ẋ = A(t)x, A(t + T ) = A(t), T > 0 (1) where A(t) is a continuous n n real complex matrix which is periodic of period T in t. Lemma 1.If C is an n n complex matrix with det C 0, then there is a complex matrix B such that C = e B. Since det C 0, the eigenvalues of C must all be non-zero. Using the decomposition into generalized eigenspaces, it suffices to deal with a single generalized eigenspace and a single non-zero eigenvalue, say λ. Thus, we may assume there is a non-singular matrix P such that P CP 1 = λi + N C 1 where N r = 0 f some r > 0. Let us first wk with C 1 = λi + N = λ(i + 1 λ N). Let b = log λ (complex if λ is not real and positive). We claim: there is a matrix S such that e S = I + 1 λ N. Assuming the claim, we get C 1 = e b e S = e bi e S = e bi+s = e B 1

October 26, 2005 15-3 with B 1 = bi + S. Then, and, P CP 1 = C 1 = e B 1 C = P 1 C 1 P = P 1 e B 1 P = e P 1 B 1 P so, it suffices to prove the claim. We want S such that e S = I + 1 λ N. The real power series f log(1 + x) is So, we might try x x2 2 + x3 3... S = log(i + 1 λ N) = N λ N 2 2λ 2 + N 3 3λ 3... Since N is nilpotent, this is a finite sum, and we leave it as an exercise to show that e S = C 1 as required. QED. Remark. Note that even if C were a real matrix with det(c) 0, the above lemma may only yield a complex matrix S such that e S = C. It is interesting to ask f the conditions under which the matrix S can also be chose to be real. The next lemma provides the answer. Lemma 2.If C is an n n real matrix, then there is a real matrix S such that C = e S if and only if det(c) 0 and C is a square (i.e., there is a real matrix A such that C = A 2. The necessity is easy since we simply take A = e 1 2 S, and observe that det(e S ) 0 f any S. F sufficiency, again we have that all the eigenvalues of C are non-zero. Since C is real, each complex eigenvalue λ its complex conjugate λ occurs with the same multiplicity. Also, since C = A 2, the real negative eigenvalues must have even multiplicity. Identifying C with its associated linear operat as usual, and taking the direct sum decomposition of R n = V 1 V 2... V k into generalized eigenspaces of C, we can express C as the sum where C = A 1 + A 2 +... + A k

October 26, 2005 15-4 1. A i A j is the zero matrix f i j, 2. f each 1 i k, dim(v i ) is even, and 3. A i V i is non-singular and has either a single non-zero real eigenvalue a single pair of non-zero complex conjugate eigenvalues; the negative real eigenvalues have even multiplicity. It then suffices to show that there is a real matrix S i such that A i = e S i f each i. We leave this last part as an exercise. QED. Theem.(Floquet) Every fundamental matrix Φ(t) f (1) has the fm Φ(t) = P (t)e Bt (2) where P (t) is a periodic matrix of period T and B is a constant matrix (which may by complex). We may always obtain (1) with a real matrix B where P (t) has period 2T. Let Φ(t) be a fundamental matrix f (1). Then, letting u = u(t) = t + T, and using A(t + T ) = A(t), we get d dt Φ(t + T ) = d du Φ(u) = A(u)Φ(u) = A(t + T )Φ(t + T ) = A(t)Φ(t + T ) so, Φ(t + T ) is also a solution matrix. Since it is non-singular, it is a fundamental matrix. Thus, there is a non-singular matrix C (possibly comples) such that Φ(t + T ) = Φ(t)C (3) By Lemma 1, there is a (possibly complex) matrix B such that e BT = C. Now, letting P (t) = Φ(t)e Bt we get Φ(t) = P (t)e Bt and P (t + T ) = Φ(t + T )e B(t+T ) = Φ(t)e Bt = P (t). In der to choose B to be real, we simply need the matrix C to be a square of some real matrix. But by (3), we have

October 26, 2005 15-5 Φ(t + 2T ) = Φ(t + T + T ) = Φ(t + T )C = Φ(t)C 2. Thus, replacing T by 2T in (3), we may obtain a real matrix B such that e B2T = C 2. Repeating the above argument then gives the result. QED Collary. There is a nonsingular periodic transfmation of variables (of period T 2T ) taking (1) into a linear differential equation with constant coefficients. Let P (t), B be as above, and set x = P (t)y. We may choose P (t) to be of period T 2T as above. Then, So, ẋ = P y + P ẏ = Ax But, P = Φe Bt, P e Bt = Φ, so = AP y AP y = P y + P ẏ P e Bt + P Be Bt = AP e Bt P + P B = AP AP y = (AP P B)y + P ẏ P By = P ẏ By = ẏ since P is non-singular. QED