In this paper we study the partial pole assignment problem for the quadratic pencil by output feedback control where the output matrix is also a designing parameter. In addition, the input matrix is set to be the transpose of the output matrix. Under certain assumption, we give a solution to this partial pole assignment problem in which the unwanted eigenvalues are moved to desired values and a...

We propose a general, numerically reliable computational approach to solve the pole and eigenstructure assignment problem for descriptor systems. In the multi-input case, the proposed approach addresses the intrinsic non-uniqueness of the pole assignment problem solution by simultaneously minimizing the sensitivity of the feedback gain and of closed-loop eigenvalues. For this purpose, a minimum...

In this paper we consider the problem of system assignment for the class of linear output feedback systems having symmetric state space realisations. For such systems the classical pole placement task can be considered as a degenerate case of a more general system assignment problem. It is shown that a symmetric state space realisation can be assigned arbitrary (real) poles via output feedback ...

In this paper, we show that a generic r-tuple of m-input p-output linear systems is simultaneously pole assignable if r < m+ p and the McMillan degrees of the systems are not too different. We also obtain upper bounds for the degrees of the compensators which simultaneously assign the characteristic polynomials of the r-tuple of closed loop systems. The upper bounds are obtained for each of the...

We present a unifying computational framework to solve robust pole assignment problems for linear systems using state feedback. The new framework uses Sylvester equation based parametrizations of the pole assignment problems. The non-uniqueness of solutions is exploited by minimizing additionally sensitivity of closed-loop eigenvalues and the norm of the corresponding state feedback matrix. The...

By using a generalized Sylvester equation based parametrization, three minimum norm robust pole assignment problems for descriptor systems are formulated as unconstrained minimization problems for suitably chosen cost functions. The derived explicit expressions of the gradients of the cost functions allow the efficient solution of the minimization problems by using powerful gradient search base...

The output feedback pole assignment problem is a classical problem in linear systems theory. In this paper we calculate the number of complex dynamic compensators of order q assigning a given set of poles for a q-nondegenerate m-input, p-output system of McMillan degree n = q(m+p? 1) + mp. As a corollary it follows that when this number is odd, the generic system can be arbitrarily pole assigne...