State-transition matrix explained

x at an initial time t _{0} gives x at a later time t . The state-transition matrix can be used to obtain the general solution of linear dynamical systems.

Linear systems solutions

The state-transition matrix is used to find the solution to a general state-space representation of a linear system in the following form

• x (t) = A (t) x (t) + B (t) u (t) , x (t _{0)} = x _{0} ,where x (t) are the states of the system, u (t) is the input signal, A (t) and B (t) are matrix functions, and x _{0} is the initial condition at t _{0} . Using the state-transition matrix \Phi (t, \tau) , the solution is given by:^{[1] [2]} x (t) = \Phi (t, t _{0)x(t} _{0)+\int} ^{t} ^{t _{0}} \Phi (t, \tau) B (\tau) u (\tau)d\tau

The first term is known as the zero-input response and represents how the system's state would evolve in the absence of any input. The second term is known as the zero-state response and defines how the inputs impact the system.

Peano–Baker series

The most general transition matrix is given by a product integral, referred to as the Peano–Baker series

\begin{align} \Phi (t,\tau) = I & + \int ^{t A (\sigma} _{1 )d\sigma} _{1} \\ & + \int ^{t A (\sigma} _{1 )\int} ^{\sigma _{1}} ^{\tau} A (\sigma _{2)d\sigma} _{2d\sigma} _{1} \\ & + \int ^{t A (\sigma} _{1 )\int} ^{\sigma _{1}} ^{\tau} A (\sigma _{2)\int} ^{\sigma _{2}} ^{\tau} A (\sigma _{3)d\sigma} _{3d\sigma} _{2d\sigma} _{1} \\ & + … \end{align} where I is the identity matrix. This matrix converges uniformly and absolutely to a solution that exists and is unique. The series has a formal sum that can be written as\Phi (t,\tau) = \exp l{T}\int ^{t A (\sigma)d\sigma} _{\tau} where l{T} is the time-ordering operator, used to ensure that the repeated product integral is in proper order. The Magnus expansion provides a means for evaluating this product.

Other properties

The state transition matrix

\Phi satisfies the following relationships. These relationships are generic to the product integral.

1. It is continuous and has continuous derivatives.

2, It is never singular; in fact

\Phi ^{-1} (t, \tau) = \Phi (\tau, t) and \Phi ^{-1} (t, \tau) \Phi (t, \tau) = I , where I is the identity matrix.

3.

\Phi (t, t) = I for all t .^[3]

4.

\Phi (t _{2,} t _{1)\Phi(t} _{1,} t _{0)} = \Phi (t _{2,} t _{0)} for all t _{0} \leq t _{1} \leq t _{2} .

5. It satisfies the differential equation

(\partial \Phi (t, t _{0)})/(\partial t) = A (t) \Phi (t, t _{0)} with initial conditions \Phi (t _{0,} t _{0)} = I .

6. The state-transition matrix

\Phi (t, \tau) , given by\Phi (t, \tau)\equiv U (t) U ^{-1} (\tau) where the n x n matrix U (t) is the fundamental solution matrix that satisfies• U (t) = A (t) U (t) with initial condition U (t _{0)} = I .

7. Given the state

x (\tau) at any time \tau , the state at any other time t is given by the mappingx (t) = \Phi (t, \tau) x (\tau)

Estimation of the state-transition matrix

In the time-invariant case, we can define

\Phi , using the matrix exponential, as \Phi (t, t _{0)} = e ^{A (t - t _{0)}} . ^[4]

In the time-variant case, the state-transition matrix

\Phi (t, t _{0)} can be estimated from the solutions of the differential equation • u (t) = A (t) u (t) with initial conditions u (t _{0)} given by [ 1 , 0 , \ldots, 0 ] ^{T} , [ 0 , 1 , \ldots, 0 ] ^{T} , ..., [ 0 , 0 , \ldots, 1 ] ^{T} . The corresponding solutions provide the n columns of matrix \Phi (t, t _{0)} . Now, from property 4, \Phi (t, \tau) = \Phi (t, t _{0)\Phi(\tau,} t ^{-1} _{0 )} for all t _{0} \leq \tau \leq t . The state-transition matrix must be determined before analysis on the time-varying solution can continue.

See also

• Magnus expansion
• Liouville's formula

Further reading

• Baake, M. . Schlaegel, U. . 2011 . The Peano Baker Series . Proceedings of the Steklov Institute of Mathematics . 275 . 155–159. 10.1134/S0081543811080098 . 119133539 .
• Book: Brogan, W.L. . 1991 . Modern Control Theory . Prentice Hall . 0-13-589763-7 . registration .

Notes and References

1. Baake. Michael. Schlaegel. Ulrike. The Peano Baker Series. Proceedings of the Steklov Institute of Mathematics. 2011. 275. 155–159. 10.1134/S0081543811080098. 119133539.
2. Book: Rugh. Wilson. Linear System Theory. 1996. Prentice Hall. Upper Saddle River, NJ . 0-13-441205-2.
3. Book: Brockett, Roger W.. Finite Dimensional Linear Systems. John Wiley & Sons. 1970. 978-0-471-10585-5.
4. Reyneke . Pieter V. . Polynomial Filtering: To any degree on irregularly sampled data . Automatika . 2012 . 53 . 4 . 382–397. 10.7305/automatika.53-4.248 . 40282943 . free . 2263/21017 . free .