Title :
Two algorithms arising in analysis of polynomial models
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
Abstract :
Algorithms for testing observability and forward accessibility of discrete-time polynomial systems are presented. The algorithms are based on symbolic computation packages-the Grobner basis method and QEP-CAD. The observability test checks observability of general polynomial systems in finite time. Forward accessibility test is applicable to a large class of polynomial systems and also stops in finite time.
Keywords :
"Algorithm design and analysis","Polynomials","Observability","System testing","Controllability","Packaging","Nonlinear systems","Distillation equipment","Milling machines","Linear systems"
Conference_Titel :
American Control Conference, 1998. Proceedings of the 1998
Print_ISBN :
0-7803-4530-4
DOI :
10.1109/ACC.1998.707350
