Backward Error Analysis for a Pole Assignment Algorithm
- 1 October 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 10 (4) , 446-456
- https://doi.org/10.1137/0610032
Abstract
Of the six or so pole assignment algorithms currently available, several have been claimed to be numerically stable, but no proofs have been published to date. It is shown, by performing a backward error analysis, that one of these algorithms, due to Petkov, Christov, and Konstantinov [IEEE Trans. Automat. Control, AC–29 (1984), pp. 1045–10481 is numerically stable. Of the six or so pole assignment algorithms currently available, several have been claimed to be numerically stable, but no proofs have been published to date. It is shown, by performing a backward error analysis, that one of these algorithms, due to Petkov, Christov, and Konstantinov [IEEE Trans. Automat. Control, AC–29 (1984), pp. 1045–10481 is numerically stable.Keywords
This publication has 6 references indexed in Scilit:
- A computational algorithm for pole assignment of linear single-input systemsIEEE Transactions on Automatic Control, 1984
- An algorithm for pole assignment of time invariant linear systems†International Journal of Control, 1982
- A Schur method for pole assignmentIEEE Transactions on Automatic Control, 1981
- The generalized eigenstructure problem in linear system theoryIEEE Transactions on Automatic Control, 1981
- Properties of numerical algorithms related to computing controllabilityIEEE Transactions on Automatic Control, 1981
- Matrices, polynomials, and linear time-variant systemsIEEE Transactions on Automatic Control, 1973