State-transition matrix

State-transition matrix

In control theory, the state-transition matrix is a matrix whose product with the state vector 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.

Overview

Consider the general linear state space model: dot{mathbf{x(t) = mathbf{A}(t) mathbf{x}(t) + mathbf{B}(t) mathbf{u}(t): mathbf{y}(t) = mathbf{C}(t) mathbf{x}(t) + mathbf{D}(t) mathbf{u}(t)The general solution is given by: mathbf{x}(t)= mathbf{Phi} (t, t_0)mathbf{x}(t_0)+int_{t_0}^t mathbf{Phi}(t, au)mathbf{B}( au)mathbf{u}( au)d auThe state-transition matrix mathbf{Phi}(t, au), given by: mathbf{Phi}(t, au)equivmathbf{U}(t)mathbf{U}^{-1}( au)where mathbf{U}(t) is the fundamental solution matrix that satisfies: dot{mathbf{U(t)=mathbf{A}(t)mathbf{U}(t)is a n imes n matrix that is a linear mapping onto itself, i.e., with mathbf{u}(t)=0, given the state mathbf{x}( au) at any time au, the state at any other time t is given by the maping:mathbf{x}(t)=mathbf{Phi}(t, au)mathbf{x}( au)

While the state transtion matrix φ is not completely unknown, it must always satisfy the following relationships:

:frac{partial phi(t, t_0)}{partial t} = A(t)phi(t, t_0)

:phi( au, au) = I

And φ also must have the following properties:

:

If the system is time-invariant, we can define φ as:

:phi(t, t_0) = e^{A(t - t_0)}

In the time-variant case, there are many different functions that may satisfy these requirements, and the solution is dependant on the structure of the system. The state-transition matrix must be determined before analysis on the time-varying solution can continue.

References

* cite book
author = Brogan, W.L.
year = 1991
title = Modern Control Theory
publisher = Prentice Hall
isbn = 0135897637


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • transition matrix — adjective a square matrix whose rows consist of nonnegative real numbers, with each row summing to . Used to describe the transitions of a Markov chain; its element in the th row and th column describes the probability of moving from state to… …   Wiktionary

  • Matrix difference equation — A matrix difference equation[1][2] is a difference equation in which the value of a vector (or sometimes, a matrix) of variables at one point in time is related to its own value at one or more previous points in time, using matrices. Occasionally …   Wikipedia

  • Matrix mechanics — Quantum mechanics Uncertainty principle …   Wikipedia

  • Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… …   Wikipedia

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • Transition dipole moment — The Transition dipole moment or Transition moment, usually denoted scriptstyle{mathbf{d} {nm for a transition between an initial state, scriptstyle{m}, and a final state, scriptstyle{n}, is the electric dipole moment associated with the… …   Wikipedia

  • Matrix metalloproteinase — Cell surface associated MT1 MMP (MMP14), Green fluorescent protein (GFP) fused to the C term produces a signal on the surface of the cell[1] Matrix metalloproteinases (MMPs) are zinc dependent endopeptidases; other family members are adamalysins …   Wikipedia

  • Stochastic matrix — For a matrix whose elements are stochastic, see Random matrix In mathematics, a stochastic matrix (also termed probability matrix, transition matrix, substitution matrix, or Markov matrix) is a matrix used to describe the transitions of a Markov… …   Wikipedia

  • Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

  • right stochastic matrix — adjective a square matrix whose rows consist of nonnegative real numbers, with each row summing to . Used to describe the transitions of a Markov chain; its element in the th row and th column describes the probability of moving from state to… …   Wiktionary

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”