Single-input eigenvalue assignment algorithms: A close look (original) (raw)

A close-look is given 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-o-error analysis. The di erences between this new algorithm and the other QR algorithms are discussed. Also, the round-o error analysis of a simple recursive algorithm for the problem (Datta (1987)) 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.