Algorithms for Robust Pole Assignment in Singular Systems

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Kautsky, J. and Nichols, N. orcid id iconORCID: https://orcid.org/0000-0003-1133-5220 (1986) Algorithms for Robust Pole Assignment in Singular Systems. In: The American Control Conference, 18-20 June 1986, Seattle WA USA, pp. 433-436.

Abstract/Summary

The solution of the pole assignment problem by feedback in singular systems is parameterized and conditions are given which guarantee the regularity and maximal degree of the closed loop pencil. A robustness measure is defined, and numerical procedures are described for selecting the free parameters in the feedback to give optimal robustness.

Item Type Conference or Workshop Item (Paper)
URI https://reading-clone.eprints-hosting.org/id/eprint/27625
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Meteorology
Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar