and Analysis. New York: Elsevier, 2003.

While several algorithms have been developed for computing robust feedback matrices for complete pole assignment in standard first-order state-space and also for the matrix second-order systems, such algo-rithms for partial pole-placement (which is more practical for large and sparse systems) are rare. In this note, a computationally simple least-squares based algorithm for robust partial pole placement in a cubic matrix pencil arising from modelling of vibrating structures with aerodynamics effects is proposed. It should be emphasized that here we formulate the rank-two update method (for complex poles) into a least square problem with linear constraints which can be solved easily by elementary linear algebra techniques. Moreover, our new algorithm is not an iterative method. For instance, if we want to assign k pairs of complex poles, i.e., 2k number of eigenvalues then we only need to do exact k steps in our method. Clearly, this new algorithm is much sim-pler and more efficient than the only other algorithm proposed so far for this problem