Perturbation bounds for root-clustering of linear discrete-time systems (Q3982033)
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 23745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perturbation bounds for root-clustering of linear discrete-time systems |
scientific article; zbMATH DE number 23745 |
Statements
Perturbation bounds for root-clustering of linear discrete-time systems (English)
0 references
26 June 1992
0 references
Lyapunov equation
0 references
0.88018798828125
0 references
0.8452275991439819
0 references
0.8450913429260254
0 references
0.8153073191642761
0 references
The discrete-time dynamical system \(s(k+1)=Ax(k)+\Gamma[x(k)]\) is considered, where \(A\) is a stable \(n\times n\) real matrix, and \(\Gamma\) is a (generally nonlinear) uncertainty vector. Bounds are given for \(\|\Gamma[x(k)\|\cdot\| x(k)\|^{-1}\) to ensure that the eigenvalues of the system are in a fixed symmetric region \(\Omega\) (defined by a quadratic inequality) in the complex plane. The bounds are expressed in terms of unique positive definite solution of certain Lyapunov equation formed using the matrix \(A\) and the inequality which defines \(\Omega\). Analogous bounds are obtained for the case the uncertainty vector is linear \(\Gamma[x(k)]=E(k)x(k)\) and the perturbation \(E(k)\) is assumed highly structured. Finally, a sufficient condition for all eigenvalues of an interval matrix \(A\) to lie in \(\Omega\) is given, again in terms of an inequality involving unique positive definite solution of a certain Lyapunov equation.
0 references