View article

It is shown that the pole assignment problem can be reduced to solving the linear matrix equations AX − XA = −BG, FX = G successively for X, and then F for almost any choice of G. The result is a new pole assignment procedure and proof of the pole assignment theorem that should play an important role in both theoretical and practical applications.