Abstract

The causal and non-causal reachability Gramians are used, in order to define the reachability subspace which is the set of all states reachable from the origin. Controllability of the disrete-time regular descriptor system by means of the forward solution is examined and new criteria for testing reachability (controllability from the origin) and controllability to the origin in the forward sense are proved.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.