Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
Academic Editor: J. Rodellar
Copyright © 2010 Hao Liu. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Pole assignment problems are special algebraic inverse eigenvalue problems. In
this paper, we research numerical methods of the robust pole assignment problem for second-order systems. The problem is formulated as an optimization problem. Depending upon whether the prescribed eigenvalues are real or complex, we separate
the discussion into two cases and propose two algorithms for solving this problem. Numerical examples show that the problem of the robust eigenvalue assignment for the quadratic pencil can be solved effectively.