An extension of the pole assignment for descriptor linear systems with nonsquare matrix pencils (Q1369085)

Consider the singular descriptor linear time-invariant system \(Ex'= Ax+Bu\), where \(E\), \(A\in \mathbb{R}^{q\times n}\), \(B\in\mathbb{R}^{q \times m}\), \(q\neq n\), \(\text{rank} (E)=r<p:= \min \{q,n\}\), \(\text{rank} (B)=m\) and \(\text{rank} (Es-A) <p\) for all \(s\in {\mathcal C}\). The pole assignment problem is formulated as follows. Given a set of \(r\) complex numbers \(\{s_1, \dots, s_r\}\), symmetric relative to the real axis, find a gain matrix \(K\in \mathbb{R}^{m \times n}\) such that the matrix \(Es-A+BK\) is of full normal rank and \(\text{rank} (Es_j- A+BK) <p\), \(j=1, \dots, r\). The case \(q=n\) had been considered in previous papers of the author [see e.g. \textit{T. Kaczorek}, ibid. 43, 505-516 (1995; Zbl 0881.93034)]. Suppose that \(q<n\) (the case \(q>n\) is treated similarly). It is shown that the pole assignment problem is solvable if and only if \(\text{rank} ([Es-A,B]) =q\) for all finite \(s\in {\mathcal C}\) (this an analogue of the Hautus condition) and \(\text{rank} ([E,B]) =q\). A procedure is proposed for constructing \(K\), based on general linear transformations of the matrix pencil \(sE-A\to sPEQ-PAQ\). Reviewer's remark: A similar procedure, based on orthogonal transformations (with \(P\) and \(Q\) being orthogonal matrices), may also be derived, which is preferable from the computational point of view.