Pole assignment : a new proof and algorithms

In this paper a new proof of the pole assignment theorem is given. This proof is a very straightforward one. It is not based on canonical forms and also the reduction to the single input case (Heymann's Lemma) is not used. Furthermore, an algorithm is given which is based on structural properties and also an algorithm is presented which allows to take into account numerical aspects. This latter algorithm uses only unitary matrices as transforming matrices preceding the pole assignment.