An algorithm for the single-input partial pole assignment problem
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XI, Tome 229 (1995), pp. 5-28
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
An algorithm for translating unstable eigenvalues of single-input partial pole assignment problems based on rank-one transformations is suggested. Special attention is paid to the practical case where translations are constructed using inexact spectral information provided by the Arnoldi procedure. Estimates of the resulting perturbations of stable and translated poles are derived. These estimates depend on the accuracy of spectral information about the unstable poles. The algorithm proposed is illustrated with numerical examples. Bibliography: 11 titles.