Robustness in Identification and Control 1989
DOI: 10.1007/978-1-4615-9552-6_7
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Nyquist Tests for Robust Stability: Frequency Domain Generalizations of Kharitonov’s Theorem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0
1

Year Published

1991
1991
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(3 citation statements)
references
References 9 publications
0
2
0
1
Order By: Relevance
“…Substantially simpler geometric proofs can be found e.g. in (Anagnost et al 1989;Dasgupta 1988;Minnichelli et al 1989) or in (Matušů and Prokop 2008). Besides, an array of improvements of the Kharitonov theorem can be found in literature.…”
Section: The Kharitonov Theoremmentioning
confidence: 99%
“…Substantially simpler geometric proofs can be found e.g. in (Anagnost et al 1989;Dasgupta 1988;Minnichelli et al 1989) or in (Matušů and Prokop 2008). Besides, an array of improvements of the Kharitonov theorem can be found in literature.…”
Section: The Kharitonov Theoremmentioning
confidence: 99%
“…In this regard, mention can be made of [11], [12], [13], where frequency-like methods are applied to the characteristic (pseudo) polynomial of a fractional-order system, of [14], where reference is made to systems in Lure's form, of [15], where non-commensurate delay systems are considered, and of [16], [17] that present adaptations of the classical algebraic criteria of Routh and Jury. Quite understandably, these contributions naturally pertain to the broader, and by now well-established, line of research on root clustering [18], [19], [20], robust and D-stability [21], [22], [23]. Most of the aforementioned results require a fairly strong mathematical background and lead to tests that are not easily implemented.…”
Section: Introductionmentioning
confidence: 99%
“…In del' Zwischenzeit wurde in[21] ein einfacherer Beweis angegeben, del' auf dem Prinzip des Nullausschlusses aus der Wertemenge von p(jw, a) basiert, d.h. der Ursprung darf nicht in der Wertemenge enthalten sein. In del' Zwischenzeit wurde in[21] ein einfacherer Beweis angegeben, del' auf dem Prinzip des Nullausschlusses aus der Wertemenge von p(jw, a) basiert, d.h. der Ursprung darf nicht in der Wertemenge enthalten sein.…”
unclassified