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
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n16http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n18http://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#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985556%3A_____%2F01%3A16010236%21RIV%2F2003%2FAV0%2FA16003%2FN/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985556%3A_____%2F01%3A16010236%21RIV%2F2003%2FAV0%2FA16003%2FN
rdf:type
n11:Vysledek skos:Concept
dcterms: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. 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.
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:_____/01:16010236!RIV/2003/AV0/A16003/N
n3:strany
1;11
n3:aktivita
n6:P n6:Z
n3:aktivity
P(KSK1019101), Z(AV0Z1075907)
n3:dodaniDat
n4:2003
n3:domaciTvurceVysledku
Henrion, Didier
n3:druhVysledku
n17:D
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
685359
n3:idVysledku
RIV/67985556:_____/01:16010236
n3:jazykVysledku
n19:eng
n3:klicovaSlova
strictly positive real; polynomial; linear matrix inequalities
n3:klicoveSlovo
n10:strictly%20positive%20real n10:polynomial n10:linear%20matrix%20inequalities
n3:kontrolniKodProRIV
[FE7D2A6D88E1]
n3:mistoKonaniAkce
Toulouse [FR]
n3:mistoVydani
Toulouse
n3:nazevZdroje
Proceedings of the Workshop on Electronics, Control, Modelling, Measurement and Signals.
n3:obor
n13:BC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n14:KSK1019101
n3:rokUplatneniVysledku
n4:2001
n3:tvurceVysledku
Henrion, Didier
n3:typAkce
n5:WRD
n3:zahajeniAkce
2001-05-30+02:00
n3:zamer
n18:AV0Z1075907
s:numberOfPages
11
n16:hasPublisher
ECMMS