1994
DOI: 10.1109/9.280760
|View full text |Cite
|
Sign up to set email alerts
|

An iterative algorithm for pole placement by output feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2000
2000
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…The results on eigenvalue assignability for generic systems can be summarized as follows [50]: If d(m, r) is odd, the eigenvalues of a generic system can be assigned arbitrarily by static output feedback (13) if and only if condition (17) holds. If d(m, r) is even, the generic system has the arbitrary eigenvalue assignability if mr > n. For procedures to solve the assignment problem with static output feedback numerically see [15,16,22,30,55] and references cited therein. Instead of eigenvalue placement, we consider the stabilization problem now.…”
Section: Static Output Feedback Designmentioning
confidence: 99%
See 1 more Smart Citation
“…The results on eigenvalue assignability for generic systems can be summarized as follows [50]: If d(m, r) is odd, the eigenvalues of a generic system can be assigned arbitrarily by static output feedback (13) if and only if condition (17) holds. If d(m, r) is even, the generic system has the arbitrary eigenvalue assignability if mr > n. For procedures to solve the assignment problem with static output feedback numerically see [15,16,22,30,55] and references cited therein. Instead of eigenvalue placement, we consider the stabilization problem now.…”
Section: Static Output Feedback Designmentioning
confidence: 99%
“…was introduced in [18]. In [10], the authors considered different static output feedback structures K = k 11 k 12 k 21 k 22 , K = k 11 0 k 21 k 22 , K = k 11 0 0 k 22 (30) for system (29). .…”
Section: Specify the Variable And Proceed With The Next Variablementioning
confidence: 99%
“…However, there are many algorithms in the literature which solve this problem. Any of the algorithms given in [19,20] may be used to find a full rank constant matrix H such that (A 1 − B u HC 1 ) is stable. Lemma 3.…”
Section: Theoremmentioning
confidence: 99%
“…In principle, one can then for example apply Gröbner basis techniques however the computational complexity of such methods limits their use to small dimensional problems [1]; see also [10]. Other approaches include [18], though convergence is not analyzed and it is not clear whether the method is even locally convergent; [15] and [19] which build on eigenstructure assignment methods; and [20] which is based on numerical homotopy methods.…”
Section: Introductionmentioning
confidence: 99%