Abstract
The quantifier elimination by partial cylindrical algebraic decomposition (QEPCAD) based controllability testing for polynomial discrete-time systems is computationally very expensive and it may lead to non-terminating algorithms. We identify the structure of a large class of polynomial discrete-time systems, which reduces the computational cost associated with the dead-beat controllability test and which may lead to finite time controllability tests. For this purpose we use QEPCAD and the Grobner basis method. The structure which we identify encompasses several classes of systems for which dead-beat controllability tests exist.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
