Abstract
A close look is taken at the single-input eigenvalue assignment methods. Several previously known backward stable QR algorithms are tied together in a common framework of which each is a special case, and their connection to an explicit expression for the feedback vector is exposed. A simple new algorithm is presented and its backward stability is established by round-off error analysis. The differences between this new algorithm and the other QR algorithms are discussed. Also, the round-off error analysis of a simple recursive algorithm for the problem [B. N. Datta, IEEE Trans. Automat. Control, AC-32 (1987), pp. 414--417] is presented. The analysis shows that the latter is reliable, and the reliability can be determined during the execution of the algorithm rather cheaply. Finally, some numerical experiments comparing some of the methods are reported.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
