2002
DOI: 10.1016/s0005-1098(02)00112-7
|View full text |Cite
|
Sign up to set email alerts
|

Some applications of randomized algorithms for control system design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
33
0
5

Year Published

2006
2006
2018
2018

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 17 publications
(39 citation statements)
references
References 13 publications
1
33
0
5
Order By: Relevance
“…Based on the recent development in automated inequality-type theorem proving [31,32,33,35,36], a new stabilizing controller design method is established. Our numerical examples significantly improve the relevant results in the literature [17,21]. …”
supporting
confidence: 79%
See 3 more Smart Citations
“…Based on the recent development in automated inequality-type theorem proving [31,32,33,35,36], a new stabilizing controller design method is established. Our numerical examples significantly improve the relevant results in the literature [17,21]. …”
supporting
confidence: 79%
“…Obviously, any element in U (cl(D)) and its inverse are analytic on cl(D). The following problem is the well-known "Champagne Problem" [6,8,9,17,20,21] of simultaneous stabilization. It illustrates the difficulty in the simultaneous stabilization of three systems in general.…”
Section: Solution To the Generalized Champagne Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…The best previously known upper bound was δ * < 0.99999712, obtained from Batra's [6] estimate t * ≥ A 2 ≥ 0.0012. (The frequently cited [10,11,25] upper bound δ * < 0.9999800002 seems to come from a computational error using the lower bound A 2 ≥ 10 −5 given in [8]. )…”
Section: The Belgian Chocolate Problemmentioning
confidence: 99%