State-transition matrix

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Technical

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

๐ฑห™(t)=๐€(t)๐ฑ(t)+๐(t)๐ฎ(t),๐ฑ(t0)=๐ฑ0,

where ๐ฑ(t) are the states of the system, ๐ฎ(t) is the input signal, ๐€(t) and ๐(t) are matrix functions, and ๐ฑ0 is the initial condition at t0. Using the state-transition matrix ๐œฑ(t,ฯ„), the solution is given by:[1][2]

๐ฑ(t)=๐œฑ(t,t0)๐ฑ(t0)+โˆซt0t๐œฑ(t,ฯ„)๐(ฯ„)๐ฎ(ฯ„)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 a product integral, referred to as the Peanoโ€“Baker series

๐œฑ(t,ฯ„)=๐ˆ+โˆซฯ„t๐€(ฯƒ1)dฯƒ1+โˆซฯ„t๐€(ฯƒ1)โˆซฯ„ฯƒ1๐€(ฯƒ2)dฯƒ2dฯƒ1+โˆซฯ„t๐€(ฯƒ1)โˆซฯ„ฯƒ1๐€(ฯƒ2)โˆซฯ„ฯƒ2๐€(ฯƒ3)dฯƒ3dฯƒ2dฯƒ1+โ‹ฏ

where ๐ˆ is the identity matrix. This matrix converges uniformly and absolutely to a solution that exists and is unique.[2] The series has a formal sum that can be written as

๐œฑ(t,ฯ„)=exp๐’ฏโˆซฯ„t๐€(ฯƒ)dฯƒ

where ๐’ฏ 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 ๐œฑ 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 ๐œฑโˆ’1(t,ฯ„)=๐œฑ(ฯ„,t) and ๐œฑโˆ’1(t,ฯ„)๐œฑ(t,ฯ„)=๐ˆ, where ๐ˆ is the identity matrix.

3. ๐œฑ(t,t)=๐ˆ for all t .[3]

4. ๐œฑ(t2,t1)๐œฑ(t1,t0)=๐œฑ(t2,t0) for all t0โ‰คt1โ‰คt2.

5. It satisfies the differential equation โˆ‚๐œฑ(t,t0)โˆ‚t=๐€(t)๐œฑ(t,t0) with initial conditions ๐œฑ(t0,t0)=๐ˆ.

6. The state-transition matrix ๐œฑ(t,ฯ„), given by

๐œฑ(t,ฯ„)โ‰ก๐”(t)๐”โˆ’1(ฯ„)

where the nร—n matrix ๐”(t) is the fundamental solution matrix that satisfies

๐”ห™(t)=๐€(t)๐”(t) with initial condition ๐”(t0)=๐ˆ.

7. Given the state ๐ฑ(ฯ„) at any time ฯ„, the state at any other time t is given by the mapping

๐ฑ(t)=๐œฑ(t,ฯ„)๐ฑ(ฯ„)

Estimation of the state-transition matrix

In the time-invariant case, we can define ๐œฑ, using the matrix exponential, as ๐œฑ(t,t0)=e๐€(tโˆ’t0). [4]

In the time-variant case, the state-transition matrix ๐œฑ(t,t0) can be estimated from the solutions of the differential equation ๐ฎห™(t)=๐€(t)๐ฎ(t) with initial conditions ๐ฎ(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

Template:Reflist

Further reading

Template:Wikibooks

Template:Matrix classes