B. N. Datta and K. Datta have proposed an efficient parallel algorithm
for the single-input pole assignment problem when the spectrum set to
be assigned is pairwise distinct and disjoint from the spectrum of th
e dynamical matrix. This paper first presents a theoretical analysis o
f that algorithm and then presents the necessary modifications on it f
or an arbitrary spectrum. Based on the modified algorithm, the authors
present two new algorithms for the problem and give some results on c
ontrollability that are of independent interests.