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

A new technique is presented for testing the stability and stabilizability of discrete-time nonlinear systems with polynomial type nonlinearities. This technique is based on symbolic computation involving quantifier elimination in the first-order theory of real closed fields. Constrained stabilizability problems can also be tackled with this technique. A simple example is given to illustrate the use of the technique.