State Transition Matrix & Forced Response

The state transition matrix propagates an initial condition through linear dynamics; convolution with the same propagator accumulates input and disturbance effects. This chapter derives both parts, relates modes to eigenstructure, and connects exact propagation to sampled-data models.

The state equation is local: it gives the instantaneous velocity x˙\dot x. The state transition matrix turns that local rule into a finite-time map. It is the bridge between differential equations, modal behavior, sampled models, controllability, and prediction.

Autonomous LTI propagation #

For

x˙=Ax,x(t0)=x0,\dot x=Ax,\qquad x(t_0)=x_0,

the solution is

x(t)=Φ(t,t0)x0.x(t)=\Phi(t,t_0)x_0.

For constant AA,

Φ(t,t0)=eA(t−t0),eAτ=I+Aτ+(Aτ)22!+⋯ .\Phi(t,t_0)=e^{A(t-t_0)},\qquad e^{A\tau}=I+A\tau+\frac{(A\tau)^2}{2!}+\cdots.

This matrix has the defining properties

Φ(t0,t0)=I,Φ(t2,t0)=Φ(t2,t1)Φ(t1,t0),∂Φ∂t=AΦ.\Phi(t_0,t_0)=I,\qquad \Phi(t_2,t_0)=\Phi(t_2,t_1)\Phi(t_1,t_0),\qquad \frac{\partial\Phi}{\partial t}=A\Phi.

The composition law says that state is sufficient: propagating from t0t_0 to t2t_2 directly gives the same result as stopping at t1t_1 and continuing from the state there.

Initial-state and forced contributions to state propagation The initial state is propagated through the transition matrix. The input history is mapped through B, propagated from each input time, and integrated. The two contributions sum to the final state. x(t₀) Φ(t,t₀) transport initial state u(τ) B Φ(t,τ) transport each input nudge then integrate over τ Σ x(t) x(t) = Φ(t,t₀)x(t₀) + ∫ Φ(t,τ)Bu(τ)dτ
The homogeneous term transports the initial condition. Every infinitesimal input contribution is transported from its application time to the observation time, then all contributions are integrated.

Inputs create a forced response #

For

x˙=Ax+Bu,\dot x=Ax+Bu,

variation of constants gives

x(t)=eA(t−t0)x0+∫t0teA(t−τ)B u(τ) dτ.x(t)=e^{A(t-t_0)}x_0+ \int_{t_0}^{t}e^{A(t-\tau)}B\,u(\tau)\,d\tau.

The first term is the zero-input or homogeneous response. The integral is the zero-state or forced response. A disturbance channel EdEd adds another integral with Ed(τ)E d(\tau). Output is then y(t)=Cx(t)+Du(t)y(t)=Cx(t)+Du(t).

Worked double-integrator example #

Let position qq, velocity vv, and commanded acceleration uu satisfy

x=[qv],A=[0100],B=[01].x=\begin{bmatrix}q\\v\end{bmatrix},\quad A=\begin{bmatrix}0&1\\0&0\end{bmatrix},\quad B=\begin{bmatrix}0\\1\end{bmatrix}.

Because A2=0A^2=0, the exponential series terminates:

eAt=I+At=[1t01].e^{At}=I+At=\begin{bmatrix}1&t\\0&1\end{bmatrix}.

Therefore

v(t)=v0+∫0tu(τ) dτ,v(t)=v_0+\int_0^t u(\tau)\,d\tau,

q(t)=q0+tv0+∫0t(t−τ)u(τ) dτ.q(t)=q_0+t v_0+\int_0^t(t-\tau)u(\tau)\,d\tau.

The weighting (t−τ)(t-\tau) has a physical explanation: an early acceleration changes velocity for longer, so it accumulates more position change than the same acceleration applied near the final time.

Modes, Jordan structure, and stability #

If A=VΛV−1A=V\Lambda V^{-1} is diagonalizable,

eAt=VeΛtV−1,e^{At}=Ve^{\Lambda t}V^{-1},

so each eigenvalue contributes a modal factor eλite^{\lambda_i t}. Its real part sets exponential growth or decay; its imaginary part sets oscillation frequency. Repeated or defective eigenvalues add polynomial factors such as teλtt e^{\lambda t} through Jordan blocks.

For continuous LTI dynamics, asymptotic stability requires every eigenvalue of AA to have strictly negative real part. Eigenvalues on the imaginary axis need a finer test: a repeated or defective marginal mode can grow polynomially even though its real part is zero.

Diagonalization is an explanatory tool, not the default numerical algorithm. Nearly parallel eigenvectors make VV ill-conditioned, and forming VeΛtV−1V e^{\Lambda t}V^{-1} can lose accuracy. Production matrix-exponential routines use scaling, squaring, Padé, or Schur-based methods.

Exact sampled propagation #

With a zero-order-held command u(t)=uku(t)=u_k over [kTs,(k+1)Ts)[kT_s,(k+1)T_s),

xk+1=Adxk+Bduk,x_{k+1}=A_dx_k+B_du_k,

Ad=eATs,Bd=∫0TseAτB dτ.A_d=e^{AT_s},\qquad B_d=\int_0^{T_s}e^{A\tau}B\,d\tau.

The block exponential evaluates both without requiring A−1A^{-1}:

exp⁡([AB00]Ts)=[AdBd0I].\exp\left( \begin{bmatrix}A&B\\0&0\end{bmatrix}T_s \right) = \begin{bmatrix}A_d&B_d\\0&I\end{bmatrix}.

This matters when AA is singular, as in the double integrator. The common shortcut Bd=A−1(Ad−I)BB_d=A^{-1}(A_d-I)B is then unavailable even though the integral is perfectly well-defined.

Time variation changes the rule #

For x˙=A(t)x\dot x=A(t)x, a transition matrix still exists, but in general

Φ(t,t0)≠exp⁡(∫t0tA(τ) dτ)\Phi(t,t_0)\ne \exp\left(\int_{t_0}^{t}A(\tau)\,d\tau\right)

unless the matrices A(t1)A(t_1) and A(t2)A(t_2) commute for all relevant times. The order of infinitesimal transformations matters. Numerically integrate the matrix differential equation

Φ˙(t,t0)=A(t)Φ(t,t0),Φ(t0,t0)=I,\dot\Phi(t,t_0)=A(t)\Phi(t,t_0),\qquad \Phi(t_0,t_0)=I,

or use an algorithm designed for time-ordered propagation.

The transition matrix is therefore more than a closed-form trick: it is the operator that carries every initial condition, control action, and disturbance through the dynamics.

Sources

  1. docsMIT OpenCourseWare: Matrix Exponentials

Searches titles, aliases, headings, summaries, and full text.↑↓ move ↵ open esc close