This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985556%3A_____%2F02%3A16020107%21RIV%2F2003%2FGA0%2FA16003%2FN/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985556%3A_____%2F02%3A16020107%21RIV%2F2003%2FGA0%2FA16003%2FN
rdf:type
n8:Vysledek skos:Concept
dcterms:description
A necessary and sufficient condition is proposed for the existence of a polynomial p(s) such that the rational function p(s)/q(s) is robustly strictly positive real when q(s) is a 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 matrix inequalities. A necessary and sufficient condition is proposed for the existence of a polynomial p(s) such that the rational function p(s)/q(s) is robustly strictly positive real when q(s) is a 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 matrix inequalities.
dcterms:title
Linear matrix inequalities for robust strictly positive real design. Linear matrix inequalities for robust strictly positive real design.
skos:prefLabel
Linear matrix inequalities for robust strictly positive real design. Linear matrix inequalities for robust strictly positive real design.
skos:notation
RIV/67985556:_____/02:16020107!RIV/2003/GA0/A16003/N
n3:strany
1017;1020
n3:aktivita
n13:P n13:Z
n3:aktivity
P(GA102/02/0709), P(ME 427), Z(AV0Z1075907)
n3:cisloPeriodika
7
n3:dodaniDat
n7:2003
n3:domaciTvurceVysledku
Henrion, Didier
n3:druhVysledku
n11:J
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
651894
n3:idVysledku
RIV/67985556:_____/02:16020107
n3:jazykVysledku
n9:eng
n3:klicovaSlova
linear matrix inequalities; polynomial; strictly positive real
n3:klicoveSlovo
n5:linear%20matrix%20inequalities n5:polynomial n5:strictly%20positive%20real
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[A4546F4C30DC]
n3:nazevZdroje
IEEE Transactions on Circuits and Systems. Part I. Fundamental Theory and Applications
n3:obor
n16:BC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n14:GA102%2F02%2F0709 n14:ME%20427
n3:rokUplatneniVysledku
n7:2002
n3:svazekPeriodika
49
n3:tvurceVysledku
Henrion, Didier
n3:zamer
n10:AV0Z1075907
s:issn
1057-7122
s:numberOfPages
4