ConceptComplete

The Matrix Exponential

The matrix exponential eAte^{At} is the fundamental solution operator for constant-coefficient linear systems. Its computation requires understanding the Jordan normal form of AA.


Definition and Computation

Definition5.3Matrix exponential

For an n×nn \times n matrix AA, the matrix exponential is

eAt=k=0(At)kk!=I+At+A2t22!+A3t33!+e^{At} = \sum_{k=0}^{\infty}\frac{(At)^k}{k!} = I + At + \frac{A^2t^2}{2!} + \frac{A^3t^3}{3!} + \cdots

This series converges for all tt and all AA. The function Φ(t)=eAt\Phi(t) = e^{At} satisfies Φ=AΦ\Phi' = A\Phi, Φ(0)=I\Phi(0) = I.

Theorem5.3Computation via diagonalization

If A=PDP1A = PDP^{-1} where D=diag(λ1,,λn)D = \text{diag}(\lambda_1, \ldots, \lambda_n), then

eAt=PeDtP1=Pdiag(eλ1t,,eλnt)P1.e^{At} = Pe^{Dt}P^{-1} = P\,\text{diag}(e^{\lambda_1 t}, \ldots, e^{\lambda_n t})\,P^{-1}.

More generally, if A=PJP1A = PJP^{-1} where JJ is the Jordan form, then eAt=PeJtP1e^{At} = Pe^{Jt}P^{-1}.

ExampleMatrix exponential of a $2 \times 2$ matrix

For A=(2102)A = \begin{pmatrix}2 & 1\\0 & 2\end{pmatrix} (Jordan block with λ=2\lambda = 2):

A=2I+NA = 2I + N where N=(0100)N = \begin{pmatrix}0&1\\0&0\end{pmatrix}, N2=0N^2 = 0.

eAt=e2teNt=e2t(I+Nt)=e2t(1t01).e^{At} = e^{2t}e^{Nt} = e^{2t}(I + Nt) = e^{2t}\begin{pmatrix}1 & t\\0 & 1\end{pmatrix}.


Properties

RemarkKey properties
  1. eAte^{At} is always invertible: (eAt)1=eAt(e^{At})^{-1} = e^{-At}.
  2. ddteAt=AeAt\frac{d}{dt}e^{At} = Ae^{At}.
  3. If AA and BB commute (AB=BAAB = BA): e(A+B)t=eAteBte^{(A+B)t} = e^{At}e^{Bt}.
  4. det(eAt)=etr(A)t\det(e^{At}) = e^{\text{tr}(A)\cdot t} (always positive).
  5. The eigenvalues of eAte^{At} are eλjte^{\lambda_j t} where λj\lambda_j are eigenvalues of AA.

Cayley-Hamilton Method

Theorem5.4Cayley-Hamilton approach

By the Cayley-Hamilton theorem, eAte^{At} can be expressed as a polynomial in AA of degree at most n1n-1:

eAt=α0(t)I+α1(t)A++αn1(t)An1e^{At} = \alpha_0(t)I + \alpha_1(t)A + \cdots + \alpha_{n-1}(t)A^{n-1}

where the coefficients αk(t)\alpha_k(t) are determined by the equations eλjt=k=0n1αk(t)λjke^{\lambda_j t} = \sum_{k=0}^{n-1}\alpha_k(t)\lambda_j^k for each eigenvalue λj\lambda_j (with derivative conditions for repeated eigenvalues).

ExampleCayley-Hamilton computation

For A=(0123)A = \begin{pmatrix}0&1\\-2&-3\end{pmatrix} with eigenvalues λ=1,2\lambda = -1, -2:

eAt=α0(t)I+α1(t)Ae^{At} = \alpha_0(t)I + \alpha_1(t)A where et=α0α1e^{-t} = \alpha_0 - \alpha_1 and e2t=α02α1e^{-2t} = \alpha_0 - 2\alpha_1.

Solving: α1=ete2t\alpha_1 = e^{-t} - e^{-2t}, α0=2ete2t\alpha_0 = 2e^{-t} - e^{-2t}.

eAt=(2ete2tete2t2et+2e2tet+2e2t).e^{At} = \begin{pmatrix}2e^{-t}-e^{-2t} & e^{-t}-e^{-2t}\\-2e^{-t}+2e^{-2t} & -e^{-t}+2e^{-2t}\end{pmatrix}.