Computation of state reachable points of descriptor systems
Computation of state reachable points of descriptor systems
This paper considers the problem of computing the state reachable points, from the origin, of a linear constant coefficient descriptor system. A numerical algorithm is proposed that can be implemented to characterize the reachable set in a numerically stable way. The original descriptor system is transformed into a strangeness-free system …