Linear matrix inequalities for robust strictly positive real design.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F01%3A16010236" target="_blank" >RIV/67985556:_____/01:16010236 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Linear matrix inequalities for robust strictly positive real design.
Original language description
A necessary and sufficient condition is proposed for existence of a polynomial p(s)/q(s)is robustly strictly positive real when q(s) is given Hurwitz polynomial with polytopic uncertainty. It turns out that the whole set of candidates p(s) is a convex subset of the cone of positive semidefinite matrices, resulting in a straightforward strictly positive real design algorithm based on linear inequalities.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/KSK1019101" target="_blank" >KSK1019101: Mathematics, computer science and cybernetics: methods, tools and applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Workshop on Electronics, Control, Modelling, Measurement and Signals.
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
1-11
Publisher name
ECMMS
Place of publication
Toulouse
Event location
Toulouse [FR]
Event date
May 30, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—