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 p...

The eigenvalue assignment problem is a classical problem in Control Theory. This paper presents new algorithms for the stabilization of large single-input time-invariant control systems by partial eigenvalue assignment. Our algorithms are based on the implicitly restarted Arnoldi method, and are well suited for control systems that require the reassignment of a few eigenvalues.

The construction of a closed-loop observer for linear control systems and the associated eigenvalue assignment problem are classical tasks in Control Theory. The present paper describes an algorithm for the solution of this eigenvalue assignment problem. The algorithm is based on the implicitly restarted Arnoldi method, and is well suited for large-scale problems, that require the (re)assignmen...

It was recently demonstrated that a well-known eigenvalue bound for the Quadratic Assignment Problem (QAP) actually corresponds to a semideenite programming (SDP) relaxation. However, for this bound to be computationally useful the assignment constraints of the QAP must rst be eliminated, and the bound then applied to a lower-dimensional problem. The resulting \projected eigenvalue bound" is on...

the problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. the former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. nevertheless, now we can obtain the location of eigenvalues ...

The problem of the optimal eigenvalue assignment for multiinput linear systems is considered. It is proven that for an n-order system with m independent inputs, the problem is split into the following two sequential stages. Initially, the n m eigenvalues are assigned using an n m-order system. This assignment is not constrained to satisfy optimality criteria. Next, an m-order system is used to ...