Globally Convergent Algorithms for Robust Pole Assignment by State Feedback

Loading...
Thumbnail Image

Files

TR_95-3.pdf (1.34 MB)
No. of downloads: 1061

Publication or External Link

Date

1995

Advisor

Citation

DRUM DOI

Abstract

It is observed that an algorithm proposed in 1985 by Kautsky, Nichols and Van Dooren (KNV) amounts to maximize, at each iteration, the determinant of the candidate closed-loop eigenvector matrix X with respect to one of its columns (with unit length constraint), subject to the constraint that it remains a valid closed-loop eigenvector matrix. This interpretation is used to prove convergence of the KNV algorithm. It is then shown that a more efficient algorithm is obtained if det (X) is concurrently maximized with respect to two columns of X, and that such a scheme is easily extended to the case where the eigenvalues to be assigned include complex conjugate pairs. Variations exploiting the availability of multiple processors are suggested. Convergence properties of the proposed algorithms are established. Their superiority is demonstrated numerically.

Notes

Rights