By Topic

A computational algorithm for pole assignment of linear multiinput systems

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

3 Author(s)
Petkov, P.Hr. ; Higher Institute of Mechanical and Electrical Engineering, Sofia, Bulgaria ; Christov, N.D. ; Konstantinov, M.M.

An efficient computational algorithm for pole assignment of linear multiinput systems is proposed. A preliminary stage of the algorithm is a reduction of the system matrices into orthogonal canonical form. The gain matrix elements are then found by orthogonal transformation of the closed-loop system matrix into upper quasi-triangular form whose diagonal blocks correspond to the desired poles. The algorithm is numerically stable, the computed gain matrix being exact for a system with slightly perturbed matrices. It works equally well with real and complex, distinct, and multiple poles and is applicable to ill-conditioned and high-order problems.

Published in:

Automatic Control, IEEE Transactions on  (Volume:31 ,  Issue: 11 )