By Topic

An algorithm for the multiinput eigenvalue assignment problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Arnold, M. ; Dept. of Math. Sci., Northern Illinois Univ., DeKalb, IL, USA ; Datta, B.N.

A very simple and inexpensive algorithm is presented for pole placement in the multiinput case. The algorithm consists of orthogonal reduction to a Block-Hessenberg form and a simple linear recursion. It yields a matrix F such that A+BF has any specified set of eigenvalues whenever the system is controllable. It is extremely easy to program on a computer. The algorithm is not a robust pole-placement algorithm but appears to give comparable results in most well-conditioned cases at a fraction of the cost. It is a direct (noniterative) algorithm and no eigenvalues or singular values are computed. The algorithm does not need any complex arithmetic, even when complex conjugate eigenvalues need to be assigned

Published in:

Automatic Control, IEEE Transactions on  (Volume:35 ,  Issue: 10 )