2.1 Linear Systems and Matrix Exponentials

General Linear Dynamical System

can we written in the form

x˙(t)=Ax(t),ARn×n

Where it is autonomous

Matrix Exponential

A solution to

x˙(t)=Ax(t)

where x(t0)=x0 is a function x(t) defined on R such that:
tR,x(t) satisfies the equation
x(t) satisfies the initial condition

Since A is a constant matrix it is globally Lipschitz so the flow (solution) exists and is unique for the time interval on all of R.

Given a matrix AR2×2, the time-dependent matrix

eAt:=I+tA+t2A22!++tkAkk!=k=0tkAkk!,tR

is called the matrix exponential of the matrix A.

Matrix Exponential Commute Theorem

If A,BRn×n satisfy AB=BA, then

e(A+B)t=eAteBt=eBteAt.

Matrix Exponential Solution

Let ARn×n and x0Rn.
Then the unique solution of the initial value problem

x˙(t)=Ax(t),x(0)=x0

is

x(t)=eAtx0.

Proof:

Differentiate x(t) directly:

ddtx(t)=ddt(eAtx0)=ddt(k=0tkAkk!)x0.

Differentiate term-by-term (justified by uniform convergence):

ddtx(t)=(k=1ktk1Akk!)x0=(k=1tk1Ak(k1)!)x0.

Factor out A:

ddtx(t)=A(k=1tk1Ak1(k1)!)x0=A(m=0tmAmm!)x0=AeAtx0=Ax(t).x(0)=eA0x0=Ix0=x0.

Thus, x(t)=eAtx0 satisfies both the differential equation and the initial condition, proving it is the unique solution.

Basis of the Solution Space

Define

FA={x(t),tRx˙(t)=Ax(t), tR}.

Then FA is an n-dimensional vector space.
Moreover, if {xk}k=1n is a basis of Rn, then

xk(t)=eAtek,1kn

form a basis of FA.

Similar Transformations

Let ARn×n be a matrix and PRn×n any invertible matrix.
Define

B=P1AP.

Then:

y˙(t)=By(t),y(0)=y0Rn,

then x(t)=Py(t) solves

x˙(t)=Ax(t),x(0)=Py0.

Application: Change of Variables

Using the theorem above, we can solve linear systems via:

  1. Apply a linear change of variables x=Py so that A is transformed into a simpler matrix B.
  2. Compute eBt explicitly to solve for y(t).
  3. Transform back to get x(t)=Py(t).

Example 1 — Diagonal matrix

Suppose

B=[λ100λ2].

Use the series

eBt=k=0tkk!Bk.

Because Bk=diag(λ1k,λ2k),

eBt=k=0tkk!Bk=k=0tkk!diag(λ1k,λ2k)=diag(k=0(λ1t)kk!,k=0(λ2t)kk!)=diag(eλ1t,eλ2t).

Example 2 — Scaling–Rotation Matrix

Suppose

B=[abba]=aI+bJ,J:=[0110].

Note that J2=I, J3=J, J4=I, and I commutes with J.

Then

eBt=e(aI+bJ)t=eatIebtJ=eatebtJ

Expand ebtJ and split even and odd powers:

ebtJ=k=0(bt)kk!Jk=m=0(bt)2m(2m)!J2m+m=0(bt)2m+1(2m+1)!J2m+1=m=0(bt)2m(2m)!(1)mI+m=0(bt)2m+1(2m+1)!(1)mJ=cos(bt)I+sin(bt)J.

Therefore,

eBt=eat(cos(bt)I+sin(bt)J)=eat[cos(bt)sin(bt)sin(bt)cos(bt)].

Example 3 — Degenerate (Jordan) Matrix

Suppose

B=[λ10λ]=λI+N,N:=[0100],N2=0.

Since N is nilpotent of index 2,

eBt=e(λI+N)t=eλtIetN=eλtetN.

Expand etN:

etN=k=0tkk!Nk=I+tN(because N2=0).

Hence

eBt=eλt(I+tN)=eλt[1t01]=[eλtteλt0eλt].

Similar Matrices

Use the series etM=k=0tkk!Mk and Bk=(P1AP)k=P1AkP.

etB=k=0tkk!Bk=k=0tkk!P1AkPPetBP1=k=0tkk!P(P1AkP)P1=k=0tkk!Ak=etA.

So etA=PetBP1