Siegel's lemma is sharp for almost all linear systems

2019 ◽  
Vol 51 (5) ◽  
pp. 853-867
Author(s):  
Roger Baker ◽  
David Masser
1995 ◽  
Vol 120 (3-4) ◽  
pp. 307-318 ◽  
Author(s):  
Damien Roy ◽  
Jeffrey Lin Thunder

2008 ◽  
Vol 39 (1-3) ◽  
pp. 59-66 ◽  
Author(s):  
Iskander Aliev

2021 ◽  
Author(s):  
Nguyen Hoai Nam

This paper provides a solution for a linear command governor (CG) that employs invariant and constraint-admissible ellipsoid. The motivation is to substitute the typical polyhedral set used in almost all CG schemes with the ellipsoidal one, which is much easier to construct. However the price for this offline computational efficiency is that the size of the feasible set can be relatively small, and the online computational burden is heavier than that of polyhedral set based CGs. The proposed solution overcomes these two weaknesses and offers a very attractive alternative to polyhedral set based CG. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed algorithm.


1996 ◽  
Vol 26 (3) ◽  
pp. 1057-1068 ◽  
Author(s):  
D.W. Masser

1995 ◽  
Vol 42 (1) ◽  
pp. 147-162 ◽  
Author(s):  
Jeffrey Lin Thunder

Sign in / Sign up

Export Citation Format

Share Document