A new algorithm is proposed for the pole assignment of single-input linear time-invariant systems, The proposed algorithm belongs to the family of Hessenberg methods and is based on an implicit multishift QR-like technique, The new method compares favorably in many respects (speed, memory usage) with existing numerically stable methods, Its improved vectorizability guarantees good opportunities for parallel implementation on high-performance computers.