Positive Systems
DOI: 10.1007/3-540-34774-7_54
|View full text |Cite
|
Sign up to set email alerts
|

Robust Absolute Stability Using Polynomial Positivity and Sign Decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…When robust positivity is analyzed in a very simple function, Bernstein polynomials have advantages over sign decomposition, but when the function is not simple, sign decomposition has advantages over Bernstein polynomials (Graziano et al, 2004). There are several works using sign decomposition instead of Bernstein polynomials, some of them are: Guerrero, 2006;Keel et al, 2008; …”
Section: Brief Description Of Sign Decompositionmentioning
confidence: 99%
“…When robust positivity is analyzed in a very simple function, Bernstein polynomials have advantages over sign decomposition, but when the function is not simple, sign decomposition has advantages over Bernstein polynomials (Graziano et al, 2004). There are several works using sign decomposition instead of Bernstein polynomials, some of them are: Guerrero, 2006;Keel et al, 2008; …”
Section: Brief Description Of Sign Decompositionmentioning
confidence: 99%