This is an old revision of this page, as edited by Frettloe(talk | contribs) at 11:25, 4 February 2015(Added a helpful reference (readable math overview)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 11:25, 4 February 2015 by Frettloe(talk | contribs)(Added a helpful reference (readable math overview))
In control theory, the state-transition matrix is a matrix whose product with the state vector at an initial time gives at a later time . The state-transition matrix can be used to obtain the general solution of linear dynamical systems.
The state-transition matrix is used to find the solution to a general [state-space representation]] of a linear system in the following form
,
where are the states of the system, is the input signal, and is the initial condition at . Using the state-transition matrix , the solution is given by[1][2]:
Peano-Baker series
The most general transition matrix is given by the Peano-Baker series
where is the identity matrix. This matrix converges uniformly and absolutely to a solution that exists and is unique.[1]
In the time-variant case, there are many different functions that may satisfy these requirements, and the solution is dependent on the structure of the system. The state-transition matrix must be determined before analysis on the time-varying solution can continue.
Notes
Brogan, W.L. (1991). Modern Control Theory. Prentice Hall. ISBN0-13-589763-7.