Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach (Q1306036)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1343397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach |
scientific article; zbMATH DE number 1343397 |
Statements
Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach (English)
0 references
2 November 2000
0 references
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.
0 references
polynomial nonlinearities
0 references
constrained problems
0 references
stability
0 references
stabilizability
0 references
discrete-time nonlinear systems
0 references
symbolic computation
0 references
0 references
0 references
0.9350333
0 references
0.8982079
0 references
0.89707965
0 references
0.8958329
0 references
0 references
0.8926463
0 references
0.8896333
0 references
