Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach

DOI10.1016/S0947-3580(99)70135-4zbMath0947.93012OpenAlexW1997904496MaRDI QIDQ1306036

Mareels, Iven M. Y., Dragan Nešić

Publication date: 2 November 2000

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0947-3580(99)70135-4

zbMATH Keywords

stabilitysymbolic computationstabilizabilitydiscrete-time nonlinear systemsconstrained problemspolynomial nonlinearities

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Stabilization of systems by feedback (93D15) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55)

Related Items

On the solvability of polynomial systems arising in control, Discussion on: ``A reduced-order controller design for nonlinear systems with uncertainties and disturbances

Uses Software

• QEPCAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero dynamics of sampled nonlinear systems
• Partial cylindrical algebraic decomposition for quantifier elimination
• Adaptive systems: an introduction
• Constructive nonlinear control
• Structure identification of nonlinear dynamic systems - A survey on input/output approaches
• Applying Linear Quantifier Elimination
• A prediction-error and stepwise-regression estimation algorithm for non-linear systems
• Losslessness, feedback equivalence, and the global stabilization of discrete-time nonlinear systems
• Dead beat controllability of polynomial systems: symbolic computation approaches