Accessibility navigation


On computational algorithms for pole assignment

Nichols, N. (1986) On computational algorithms for pole assignment. IEEE Transactions on Automatic Control, 31 (7). pp. 643-645. ISSN 0018-9286

Full text not archived in this repository.

To link to this article 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.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Science > School of Mathematical and Physical Sciences > Department of Meteorology
Faculty of Science > School of Mathematical and Physical Sciences > Department of Mathematics and Statistics
ID Code:27550

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

Page navigation