Decentralized determinantal assignment problem: fixed and almost fixed modes and zeros

The decentralized determinantal assignment problem (DDAP) is defined as the unifying description for the study of pole and zero assignment problems under decentralized output, state feedback (DOF, DSF) and decentralized ‘squaring down’ (DSD), respectively. DDAP is reduced to a linear problem of zero assignment of polynomial combinants and a multilinear problem of restricted decomposability of multivectors. The decentralization characteristic (DC) and the decentralized polynomial Grassmann representative )D — ℝ[s] — GR) of DDAP are defined. The fixed zero polynomial of DDAP is then determined as the zero polynomial of D— ℝ[s]—GR. The canonical D—ℝ[s]—GR, (CD—R[s]—GR) and the decentralized Plucker matrix (DPM) of DDAP are introduced and necessary conditions for arbitrary assignment of the non-fixed zeros are given in terms of the DPM. The family of strongly zero non-assignable (SNA( systems is defined, and for such systems the notion of the fixed zero is extended to that of the ‘almost fixed zero’ (AFZ). An...