New techniques for the pole placement of singular systems

New techniques for pole placement problem of single input singular systems are proposed in this paper. These techniques provide different ways to approach the generalized Ackermann's formula with better numerical properties and flexibility. Since the solution of the pole placement problem depend on the singularity of the matrix E. Two sets of recursive algorithms are presented separately corresponding to the matrix E is singular and nonsingular respectively. These algorithms are verified and implemented in MATLAB program.