On computational algorithms for pole assignment

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

Nichols, N. orcid id iconORCID: https://orcid.org/0000-0003-1133-5220 (1986) On computational algorithms for pole assignment. IEEE Transactions on Automatic Control, 31 (7). pp. 643-645. ISSN 0018-9286 doi: 10.1109/TAC.1986.1104354

Abstract/Summary

A number of computationally reliable direct methods for pole assignment by feedback have recently been developed. These direct procedures do not necessarily produce robust solutions to the problem, however, in the sense that the assigned poles are insensitive to perturbalions in the closed-loop system. This difficulty is illustrated here with results from a recent algorithm presented in this TRANSACTIONS and its causes are examined. A measure of robustness is described, and techniques for testing and improving robustness are indicated.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/27550
Identification Number/DOI 10.1109/TAC.1986.1104354
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