The Jordan Normal Form: A General Approach to Solving Homogeneous Linear Systems. Mike Raugh. March 20, 2005

Similar documents
Eigenvalues and Eigenvectors

Symmetric Matrices and Quadratic Forms

ODEs II, Supplement to Lectures 6 & 7: The Jordan Normal Form: Solving Autonomous, Homogeneous Linear Systems. April 2, 2003

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

1 Last time: similar and diagonalizable matrices

Lecture 8: October 20, Applications of SVD: least squares approximation

CHAPTER 5. Theory and Solution Using Matrix Techniques

Implicit function theorem

Chapter 4. Fourier Series

U8L1: Sec Equations of Lines in R 2

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.

Matrices and vectors

U8L1: Sec Equations of Lines in R 2

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

TMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods

A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION

Machine Learning for Data Science (CS 4786)

Engineering Analysis ( & ) Lec(7) CH 2 Higher Order Linear ODEs

MATH10212 Linear Algebra B Proof Problems

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition

Chimica Inorganica 3

CHAPTER I: Vector Spaces

Ma 530 Introduction to Power Series

Complex Analysis Spring 2001 Homework I Solution

5. DIFFERENTIAL EQUATIONS

PAPER : IIT-JAM 2010

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway?

C/CS/Phys C191 Deutsch and Deutsch-Josza algorithms 10/20/07 Fall 2007 Lecture 17

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.

For a 3 3 diagonal matrix we find. Thus e 1 is a eigenvector corresponding to eigenvalue λ = a 11. Thus matrix A has eigenvalues 2 and 3.

Chapter 2: Numerical Methods

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Application of Jordan Canonical Form

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

CS284A: Representations and Algorithms in Molecular Biology

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Machine Learning for Data Science (CS 4786)

Notes The Incremental Motion Model:

CHAPTER 10 INFINITE SEQUENCES AND SERIES

6.3 Testing Series With Positive Terms

Fundamental Concepts: Surfaces and Curves

You may work in pairs or purely individually for this assignment.

5.1 Review of Singular Value Decomposition (SVD)

The Method of Least Squares. To understand least squares fitting of data.

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

Linearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation

1 Adiabatic and diabatic representations

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

Subject: Differential Equations & Mathematical Modeling -III. Lesson: Power series solutions of Differential Equations. about ordinary points

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

A Note On The Exponential Of A Matrix Whose Elements Are All 1

Assignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

1 Approximating Integrals using Taylor Polynomials

1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx

Chapter 6 Infinite Series

LINEAR ALGEBRA. Paul Dawkins

Appendix: The Laplace Transform

Chapter 10: Power Series

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

AH Checklist (Unit 3) AH Checklist (Unit 3) Matrices

Properties and Tests of Zeros of Polynomial Functions

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

Math 155 (Lecture 3)

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

MATH 10550, EXAM 3 SOLUTIONS

a is some real number (called the coefficient) other

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

Image Spaces. What might an image space be

The Growth of Functions. Theoretical Supplement

Math 113 Exam 3 Practice

Basic Iterative Methods. Basic Iterative Methods

Singular value decomposition. Mathématiques appliquées (MATH0504-1) B. Dewals, Ch. Geuzaine

SOLUTION SET VI FOR FALL [(n + 2)(n + 1)a n+2 a n 1 ]x n = 0,

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Feedback in Iterative Algorithms

18.01 Calculus Jason Starr Fall 2005

Chapter Vectors

NBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian?

Numerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets

Linear Programming and the Simplex Method

The Discrete Fourier Transform

Stochastic Matrices in a Finite Field

Linear Regression Demystified

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall

Time-Domain Representations of LTI Systems

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

Math Solutions to homework 6

6. Uniform distribution mod 1

Matrix Representation of Data in Experiment

Math 312 Lecture Notes One Dimensional Maps

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

Transcription:

The Jorda Normal Form: A Geeral Approach to Solvig Homogeeous Liear Sstems Mike Raugh March 2, 25 What are we doig here? I this ote, we describe the Jorda ormal form of a matrix ad show how it ma be used to solve a geeral homogeeous liear sstem of ordiar differetial equatios x = Ax (.) where A= A is a square -b- real matrix with costat etries. We do t show how to derive the Jorda ormal form, sice that is a more advaced topic tha we are prepared to deal with here. You are alread familiar with the simplest Jorda form uder a differet ame. It is the diagoalized represetatio for a matrix with a full set of liearl idepedet eigevectors, a topic discussed at legth i Math 63. The previous Note etitled Geeralized Eigevectors itroduced the ext simplest Jorda form, amel the Jorda block revisited below. Recall that two approaches ca be used to solve Eq. (.) i case A is diagoalizable. A is diagoalizable iff A has a complete set of liearl idepedet eigevectors, sa, { v,, v }. The first approach is to form the matrix P = [ ] v v cotaiig the eigevectors as colums, the i Eq. (.) substitute x = P a equatio that determies because of the ivertibilit of P. As we shall see below, this results i a easil solved decoupled sstem of separate first-order liear equatios, leadig immediatel to the geeral solutio of Eq. (.). The secod approach begis with a trial solutio of the form x= e v, where the costat scalar ad costat vector v are chose to satisf the costrait imposed b Eq. (.), amel, x = e v= Ae v= e Av (.2) Sice, the secod ad last members of the precedig equatio impl that Av = v, we fid that Eq. (.) has a solutio x= e v for each eigevalue-eigevector pair (, v ). It follows that, i the assumed case i which we have a complete set of liearl idepedet eigevectors { v,, v } with correspodig eigevalues {,, }, the geeral solutio of Eq. (.) is give b the liear combiatio mrr/hmc/math 64 of 5 3/2/25; 5:3 PM

x= ce v + + ce t v (.3) t for arbitrar scalars { c c },,. Jorda ormal form. Not all matrices are diagoalizable. But, ext best, ever square matrix is similar to a matrix i Jorda ormal form. I other word, if A is a square matrix, the there exists a o-sigular square matrix S such that S AS J = (.4) where J is a square matrix i the ormal form, to be described. Moreover, if the matrix ad all its eigevalues are real, there is a real matrix S that ields the Jorda form. A matrix J i the Jorda ormal form is oe that is composed of blocks o the diagoal, with each block a Jorda block: J k ( ) = (.5) k k The i each block of J must be a eigevalue of the matrix A (hece it ma equal zero), the same eigevalue ma occur i more tha oe block, but each eigevalue of A must be preset i at least oe of the blocks. The diagoal of each block sits o the diagoal of the matrix J, ad J cosists of ol zeroes outside the Jorda blocks. If all the blocks are of size oe (i.e., for each block k = ), the A is diagoalizable. The rak J is k iff, otherwise the rak is k. of k Jk Notice that whe Jk is cosidered b itself, the geometric multiplicit of i is, ad the algebraic multiplicit of is k. These multiplicities are summed i the matrix A i the sese that, if A has a total of m blocks with a idetical eigevalue, the geometric multiplicit of i A is m, ad the algebraic multiplicit is the sum of the values of k for those m blocks. The geometric multiplicit of is the dimesio of the eigespace of, ad the algebraic multiplicit of is the multiplicit of as a root of the characteristic equatio for A. If k > for at least oe Jorda block i A, the matrix A is said to be deficiet the A does ot have a full set of eigevectors. Otherwise, if the algebraic ad geometric multiplicities of A are equal, i.e., all the Jorda blocks are of size oe, the the matrix A ad all matrices similar to A have a full set of eigevectors ad the matrices are all diagoalizable; such matrices are said to be o-deficiet. To repeat, a matrix A is diagoalizable iff it is o-deficiet, i.e., iff each Jorda block of A is odeficiet. mrr/hmc/math 64 2 of 5 3/2/25; 5:3 PM

Diagoalizable Matrices. So, ow, what does this have to do with differetial equatios? Let s start with the simplest case. Suppose all the Jorda blocks of A are of size k =. This is the case metioed above i which A is diagoalizable. I that case J i Eq. (.4) is a diagoal matrix cotaiig the eigevalues of A o the diagoal, ad S is a matrix of correspodig eigevectors. If we kow S ad J, there s a eas wa to solve the sstem Eq. (.), which we repeat here for coveiece: x = Ax (.6) We referred to this method i the opeig paragraphs above, where we used the letter P to deote the matrix of eigevectors. Just substitute x = S i Eq. (.6). Here s what ou get: S = AS = J (.7) But J is a diagoal matrix cotaiig the eigevalues of A. Writig this out, we get = = (.8) So the chage of variables from x to has produced a decoupled sstem. I other words, we ca rewrite the equatio as = (.9) = Each of these equatios (.9) ca be solved separatel, ieldig all possible solutios, ad ca be represeted i the matrix formulatio ce = = (.) c e,, are arbitrar costats. But x = S, so we ca get the geeral solutio of ODE (.6) b multiplig Eq. (.) b S: where the set { c c } ce x = S (.) ce mrr/hmc/math 64 3 of 5 3/2/25; 5:3 PM

The costats { c c },, ca be chose uiquel to solve a give iitial value problem, a fact made evidet b the fact that S is ivertible. Thus, i oe swoop, our derivatio of Eq. (.) gave us the geeral solutio of ODE (.6). Notice that this method ields the same solutio as give b Eq. (.3), but the method show here exploits the uderlig structure of A more explicitl. No-diagoalizable matrices. Now we re read to solve the sstem of differetial equatios for the case of a geeral matrix A. Agai, we suppose we have alread obtaied S ad J for the Jorda from i Eq. (.4); obtaiig S is the hard part, but we assume that it has bee doe to demostrate the utilit of the Jorda form. It is sufficiet to demostrate a derivatio for the case i which J cosists of a sigle Jorda block: J = (.2) Agai, let x = S, so that the trasformed Eq. (.7) looks like: 2 + = = (.3) + This sstem of equatios is ot decoupled. Your text calls equatios of this tpe a cascade. Usig e as a itegratig factor, the sstem is easil solved progressivel i reverse order, ieldig: = c e = c + c t e t = c+ c2t+ + c e (! (.4) mrr/hmc/math 64 4 of 5 3/2/25; 5:3 PM

where c,, c are arbitrar costats of itegratio. These solutios are similar to the fuctios used i the Note etitled Geeralized Eigevectors to itroduce the Jorda form i the first place! Assemblig these results i matrix form, we get c c c c 2 c2 c3 c t 2 = = e c c t c (! (.5) Usig x = S agai, we fid a explicit geeral solutio for Eq. (.6) as c c c c 2 c2 c3 c t x = S e c c t c (! (.6) It is apparet from the precedig represetatio that the solutio space of Eq. (.6) i this case is agai a vector space of dimesio. The techique for computig geeralized eigevectors discussed i our lecture o geeralized eigevectors ad i our text is hit-ad-miss. A reliable ad sstematic solutio, as we saw above, reduces to the problem of computig a Jorda form for the give matrix A. Techiques for doig the latter are the subject of advaced liear algebra or umerical aalsis. mrr/hmc/math 64 5 of 5 3/2/25; 5:3 PM