zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Robust pole placement in LMI regions. (English) Zbl 1136.93352
Summary: We discuss analysis and synthesis techniques for robust pole placement in linear matrix inequality (LMI) regions, a class of convex regions of the complex plane that embraces most practically useful stability regions. The focus is on linear systems with static uncertainty on the state matrix. For this class of uncertain systems, the notion of quadratic stability and the related robustness analysis tests are generalized to arbitrary LMI regions. The resulting tests for robust pole clustering are all numerically tractable because they involve solving linear matrix inequalities (LMIs) and cover both unstructured and parameter uncertainty. These analysis results are then applied to the synthesis of dynamic output-feedback controllers that robustly assign the closed-loop poles in a prescribed LMI region. With some conservatism, this problem is again tractable via LMI optimization. In addition, robust pole placement can be combined with other control objectives, such as $H_2$ or $H_\infty$ performance, to capture realistic sets of design specifications. Physically motivated examples demonstrate the effectiveness of this robust pole clustering technique.

93B55Pole and zero placement problems
93B35Sensitivity (robustness) of control systems
93D09Robust stability of control systems
Full Text: DOI