An algorithm for the single-input partial pole assignment problem
- 18 Downloads
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.
KeywordsAssignment Problem Spectral Information Practical Case Partial Pole Pole Assignment
Unable to display preview. Download preview PDF.
- 1.Fr. Chatelin,Spectral Approximation of Linear Operators, Academic Press (1983).Google Scholar
- 2.Kh. D. Ikramov, “Pole placement for linear stationary systems,” in:Computational Processes and Systems, Vol. 9 (1993), pp. 135–162.Google Scholar
- 11.S. A. Kharchenko, A. Yu. Yeremin, and N. L. Zamarashkin, “Iterative solution strategies for solving large sparse automatic control problems. I: Restarted Arnoldi procedure for solving approximate partial eigenvalue assignment problems,” Research Report EM-RR-9/93, Elegant Mathematics, Inc. (USA) (1993).Google Scholar