Abstract
The causal and non-causal reachability Grammians are used, in order to define the reachability subspace of discrete-time systems. Controllability of the discrete-time regular descriptor system by means of the forward solution is also examined and new criteria for testing reachability (controllability from the origin) and controllability to the origin in the forward sense are proved.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
