A criterion of absolute stability of nonlinear sampled-data control systems in the form of numerical procedures (Q581336)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A criterion of absolute stability of nonlinear sampled-data control systems in the form of numerical procedures |
scientific article; zbMATH DE number 4018896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A criterion of absolute stability of nonlinear sampled-data control systems in the form of numerical procedures |
scientific article; zbMATH DE number 4018896 |
Statements
A criterion of absolute stability of nonlinear sampled-data control systems in the form of numerical procedures (English)
0 references
1986
0 references
Through an iterative procedure involving the solution of an eigenvalue min-max condition at the M vertices of a closed convex polyhedron \(P\subset R^ m\) and testing the validity of at most M matrix equations, the authors show that the zero solution of the discrete-time control problem \[ (1)\quad x(s+1)=[A+\sum^{m}_{i=1}k_ iu_ i(s)A_ i)]x(s),\quad s=0,1,2,... \] will be uniformly asymptotically stable for all control vectors \(u\in P\), where \(x\in R^ n\), A, \(A_ i\) are constant square matrices, and the \(k_ i\) are constants. Furthermore, if the \(k_ i\) are parameters, then the determination of a region U in parameter space for which (1) is uniformly asymptotically stable for all \(u\in P\) is formulated in terms of a mathematical programming problem. An example is given.
0 references
Lyapunov analysis
0 references
asymptotic stability
0 references
absolute stability
0 references
iterative procedure
0 references
discrete-time control problem
0 references