On computational algorithms for pole assignment |
| |
Authors: | Nichols N. |
| |
Affiliation: | University of Reading, Reading, Great Britain; |
| |
Abstract: | 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. |
| |
Keywords: | |
|
|