CACSD. Conference Proceedings. IEEE International Symposium on Computer-Aided Control System Design (Cat. No.00TH8537)
DOI: 10.1109/cacsd.2000.900179
|View full text |Cite
|
Sign up to set email alerts
|

Robust pole assignment via Sylvester equation based state feedback parametrization

Abstract: By using a Sylvester equation based parametrization, the minimum norm robust pole assignment problem for linear time-invariant systems is formulated as an unconstrained minimization problem for a suitably chosen cost function. The derived explicit expression of the gradient of the cost function allows the efficient solution of the minimization problem by using powerful gradient search based minimization techniques. We also discuss how requirements for a particular Jordan structure of the closed-loop state matr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
84
0

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 70 publications
(84 citation statements)
references
References 17 publications
0
84
0
Order By: Relevance
“…The Sylvester realizations R k , given the pivot matrix A and feedback matrix F, are all unique by construction. For the choice of A we can take a block-diagonal or block-Jordan matrix [14] which never shares eigenvalues with any of the A k matrices. This can be accomplished by choosing the eigenvalues of A close to the imaginary axis (see also the numerical simulations).…”
Section: Uniform Approach By Sylvester Equationsmentioning
confidence: 99%
“…The Sylvester realizations R k , given the pivot matrix A and feedback matrix F, are all unique by construction. For the choice of A we can take a block-diagonal or block-Jordan matrix [14] which never shares eigenvalues with any of the A k matrices. This can be accomplished by choosing the eigenvalues of A close to the imaginary axis (see also the numerical simulations).…”
Section: Uniform Approach By Sylvester Equationsmentioning
confidence: 99%
“…The matrix (18) requires the identification of , which can be computed using the technique proposed in [23]. Another interesting approach based on the solution of a Sylvester equation can be found in [24]. Some assumptions concerning observability and controllability must be satisfied for these approaches and for the uniqueness of the solution [23], [24].…”
Section: ) Pole Placement Approachmentioning
confidence: 99%
“…Another interesting approach based on the solution of a Sylvester equation can be found in [24]. Some assumptions concerning observability and controllability must be satisfied for these approaches and for the uniqueness of the solution [23], [24]. The matrix is used to place the eigenvalues of the matrix and, therefore, the poles of the root macromodels in such a way that they are equal to .…”
Section: ) Pole Placement Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…There exist a few papers on robustness for the complete eigenvalue assignment in the first-order control systems, such as those, by Keel et al [26], Keel and Bhattacharyya [25], Cavin III and Bhattacharyya [7], Varga [39,40], etc. However, work on robustness for quadratic partial eigenvalue assignment is rare.…”
Section: Q2mentioning
confidence: 99%