State-transition matrix

From HandWiki

In control theory, the state-transition matrix is a matrix whose product with the state vector x at an initial time t0 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(t0)=x0,

where x(t) are the states of the system, u(t) is the input signal, A(t) and B(t) are matrix functions, and x0 is the initial condition at t0. Using the state-transition matrix Φ(t,τ), the solution is given by:[1][2]

x(t)=Φ(t,t0)x(t0)+t0tΦ(t,τ)B(τ)u(τ)dτ

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 the Peano–Baker series

Φ(t,τ)=I+τtA(σ1)dσ1+τtA(σ1)τσ1A(σ2)dσ2dσ1+τtA(σ1)τσ1A(σ2)τσ2A(σ3)dσ3dσ2dσ1+...

where I is the identity matrix. This matrix converges uniformly and absolutely to a solution that exists and is unique.[2]

Other properties

The state transition matrix Φ satisfies the following relationships:

1. It is continuous and has continuous derivatives.

2, It is never singular; in fact Φ1(t,τ)=Φ(τ,t) and Φ1(t,τ)Φ(t,τ)=I, where I is the identity matrix.

3. Φ(t,t)=I for all t .[3]

4. Φ(t2,t1)Φ(t1,t0)=Φ(t2,t0) for all t0t1t2.

5. It satisfies the differential equation Φ(t,t0)t=A(t)Φ(t,t0) with initial conditions Φ(t0,t0)=I.

6. The state-transition matrix Φ(t,τ), given by

Φ(t,τ)U(t)U1(τ)

where the n×n matrix U(t) is the fundamental solution matrix that satisfies

U˙(t)=A(t)U(t) with initial condition U(t0)=I.

7. Given the state x(τ) at any time τ, the state at any other time t is given by the mapping

x(t)=Φ(t,τ)x(τ)

Estimation of the state-transition matrix

In the time-invariant case, we can define Φ, using the matrix exponential, as Φ(t,t0)=eA(tt0). [4]

In the time-variant case, the state-transition matrix Φ(t,t0) can be estimated from the solutions of the differential equation u˙(t)=A(t)u(t) with initial conditions u(t0) given by [1, 0, , 0]T, [0, 1, , 0]T, ..., [0, 0, , 1]T. The corresponding solutions provide the n columns of matrix Φ(t,t0). Now, from property 4, Φ(t,τ)=Φ(t,t0)Φ(τ,t0)1 for all t0τt. The state-transition matrix must be determined before analysis on the time-varying solution can continue.

See also

References

  1. Baake, Michael; Schlaegel, Ulrike (2011). "The Peano Baker Series". Proceedings of the Steklov Institute of Mathematics 275: 155–159. doi:10.1134/S0081543811080098. 
  2. Jump up to: 2.0 2.1 Rugh, Wilson (1996). Linear System Theory. Upper Saddle River, NJ: Prentice Hall. ISBN 0-13-441205-2. 
  3. Brockett, Roger W. (1970). Finite Dimensional Linear Systems. John Wiley & Sons. ISBN 978-0-471-10585-5. 
  4. Reyneke, Pieter V. (2012). "Polynomial Filtering: To any degree on irregularly sampled data". Automatika 53 (4): 382–397. doi:10.7305/automatika.53-4.248. http://hrcak.srce.hr/file/138435. 

Further reading