A system of first-order linear ODEs can be written in matrix form:
x′=Ax+f(t)
Where A is an n×n matrix and x,f∈Rn.
4.2 Homogeneous Systems with Constant Coefficients
For x′=AxTry x=veλt:
λv=Av
So λ is an eigenvalue of A and v is the corresponding eigenvector.
Case 1: A has n distinct real eigenvalues. The general solution is
x=c1v1eλ1t+⋯+cnvneλnt
Case 2: A has a repeated eigenvalue λ with algebraic multiplicity m and geometric Multiplicity k<m. Include terms involving tjeλt where generalized Eigenvectors fill out the solution space.
Case 3: Complex eigenvalues λ=α±iβ with eigenvector v=a±ib. The real solutions are eαt(acos(βt)−bsin(βt)) and eαt(asin(βt)+bcos(βt)).
4.3 The Matrix Exponential
Definition.eAt=∑k=0∞k!Aktk.
Theorem 4.1. The solution to x′=Ax with x(0)=x0 is x(t)=eAtx0.
Proposition 4.2. If A is diagonalizable as A=PDP−1Then eAt=PeDtP−1 Where eDt=diag(eλ1t,…,eλnt).
Repeated eigenvalue λ=3 with algebraic multiplicity 2.
(A−3I)=(−1−111).
Eigenvector: (11). Only one eigenvector (geometric multiplicity 1), so we need a generalized eigenvector.
Find w such that (A−3I)w=v1=(11):
(−1−111)(w1w2)=(11)
−w1+w2=1. Choose w1=0Then w2=1. So w=(01).
x(t)=c1(11)e3t+c2[(11)te3t+(01)e3t]
=e3t[c1(11)+c2(tt+1)]. ■
4.7 Fundamental Matrix
Definition. A fundamental matrixΦ(t) for the system x′=Ax is an n×n matrix whose columns form a fundamental set of solutions.
Proposition 4.3.Φ(t) satisfies Φ′=AΦAnd the general solution is x(t)=Φ(t)c for c∈Rn.
Proposition 4.4. The matrix exponential eAt is a fundamental matrix with eA⋅0=I. Any fundamental matrix can be written as Φ(t)=eAtΦ(0).
4.8 Matrix Exponential Properties
Theorem 4.5. The matrix exponential satisfies:
eA⋅0=I
dtdeAt=AeAt=eAtA
eAteAs=eA(t+s)
(eAt)−1=e−At
If AB=BAThen eA+B=eAeB
Proof of (1).eA⋅0=∑k=0∞k!Ak0k=I. ■
Proof of (2).dtdeAt=∑k=1∞(k−1)!Aktk−1=A∑j=0∞j!Ajtj=AeAt. Since A commutes with itself, AeAt=eAtA. ■
Proof of (4). From (3) with s=−t: eAte−At=eA(t−t)=e0=I. ■
4.9 Phase Portrait Analysis for 2D Systems
For the linear system x′=Ax with A a 2×2 matrix, the qualitative Behaviour near the origin is determined by the eigenvalues:
Eigenvalues
Phase Portrait
Stability
λ1,λ2<0Real, distinct
Stable node
Asymptotically stable
λ1,λ2>0Real, distinct
Unstable node
Unstable
λ1<0<λ2
Saddle point
Unstable
λ=α±iβ, α<0
Stable spiral
Asymptotically stable
λ=α±iβ, α>0
Unstable spiral
Unstable
λ=±iβ
Center
(Marginally) stable
Remark. The trace-determinant plane provides a convenient classification. Let τ=tr(A) and Δ=det(A). The eigenvalues satisfy λ2−τλ+Δ=0So:
λ=2τ±τ2−4Δ
τ2−4Δ>0: real eigenvalues (node or saddle)
τ2−4Δ<0: complex eigenvalues (spiral or center)
τ2−4Δ=0: repeated eigenvalues (proper or improper node)
Stability is determined by the sign of τ: stable if τ<0Unstable if τ>0.
Trace-Determinant Plane: Stability Classification
The trace-determinant plane classifies 2D linear systems. The parabola τ2=4Δ separates real from complex eigenvalues; the τ=0 line separates stable from unstable. The x-axis represents the trace τ and the y-axis represents Δ.
4.10 Nonhomogeneous Systems
For x′=Ax+f(t)If Φ(t) is a fundamental matrix for the Homogeneous system, the general solution is