Structural matrix minimization algorithm for implicit descriptions (Q1361339): Difference between revisions

Two implicit systems of the form \(E\dot x(t)= Ax(t)+ Bu(t)\); \(y(t)= Cx(t)\) are said to externally equivalent if the corresponding sets of possible trajectories for the external variables are the same. A system \((E_m, A_m, B_m, C_m)\) is minimal among all externally equivalent implicit systems if the corresponding state equation has the least possible number of rows, and if the state has the least possible number of components. In this paper, the authors present an algorithm for finding this minimal systems starting form a given system \((E, A, B, C)\). This is done by calculating several subspaces, such as the non-observable subspace. These subspaces are also useful for (geometrically) characterizing system properties such as reachability.