Linear time-invariant descriptor system, behavior formulation, strangeness-free formulation, reachability, derivative array, second order system.
This paper considers the problem of computing the state reachable points (from the origin) of a linear constant coefficient second order descriptor system. A new method is proposed to compute the reachable set in a numerically stable way. The original descriptor system is transformed into a strangeness-free system within the behavioral framework followed by a projection that separates the system into different order differential and algebraic equations while keeping the original state variables. This reformulation is followed by a first order formulation that avoids all unnecessary smoothness requirements. For the resulting first order system, it is shown that the computation of the image space of two matrices, associated with the projected system, is enough to numerically compute the reachable set. Moreover, a characterization is presented of all the inputs by which one can reach an arbitrary point in the reachable set. These results are used to compute two different types of reachable sets for second order systems. The new approach is demonstrated through a numerical example.
Datta, Subashish Ph.D. and Mehrmann, V.
"Computation of State Reachable Points of Second Order Linear Time-Invariant Descriptor Systems",
Electronic Journal of Linear Algebra,
Volume 32, pp. 301-316.