In control theory, a Kalman decomposition provides a mathematical means to convert a representation of any linear time-invariant (LTI) control system to a form in which the system can be decomposed into a standard form which makes clear the observable and controllable components of the system. This decomposition results in the system being presented with a more illuminating structure, making it easier to draw conclusions on the system's reachable and observable subspaces.
Definition Consider the continuous-time LTI control system
x ˙ ( t ) = A x ( t ) + B u ( t ) {\displaystyle {\dot {x}}(t)=Ax(t)+Bu(t)} ,
y ( t ) = C x ( t ) + D u ( t ) {\displaystyle \,y(t)=Cx(t)+Du(t)} , or the discrete-time LTI control system
x ( k + 1 ) = A x ( k ) + B u ( k ) {\displaystyle \,x(k+1)=Ax(k)+Bu(k)} ,
y ( k ) = C x ( k ) + D u ( k ) {\displaystyle \,y(k)=Cx(k)+Du(k)} . The Kalman decomposition is defined as the realization of this system obtained by transforming the original matrices as follows:
A ^ = T A T − 1 {\displaystyle \,{\hat {A}}=TA{T}^{-1}} ,
B ^ = T B {\displaystyle \,{\hat {B}}=TB} ,
C ^ = C T − 1 {\displaystyle \,{\hat {C}}=C{T}^{-1}} ,
D ^ = D {\displaystyle \,{\hat {D}}=D} , where T − 1 {\displaystyle \,T^{-1}} is the coordinate transformation matrix defined as
T − 1 = [ T r o ¯ T r o T r o ¯ T r ¯ o ] {\displaystyle \,T^{-1}={\begin{bmatrix}T_{r{\overline {o}}}&T_{ro}&T_{\overline {ro}}&T_{{\overline {r}}o}\end{bmatrix}}} , and whose submatrices are
T r o ¯ {\displaystyle \,T_{r{\overline {o}}}} : a matrix whose columns span the subspace of states which are both reachable and unobservable.
T r o {\displaystyle \,T_{ro}} : chosen so that the columns of [ T r o ¯ T r o ] {\displaystyle \,{\begin{bmatrix}T_{r{\overline {o}}}&T_{ro}\end{bmatrix}}} are a basis for the reachable subspace.
… excerpt ends here. Continue reading the full article.
