Pole Placement and Matrix Extension Problems: A Common Point of View
The paper is structured as follows: Section 1 is introduction and motivational examples. In Section 2, the authors introduce a natural compactification of the linear space \({\mathcal L}\) which they denote by \(\overline{\mathcal L}\). In order to prove the main theorem they show that one has a characteristic map \(\chi\) defined on a Zariski open set of the variety \(\overline{\mathcal L}\). As a consequence the number of solutions in the critical dimension is equal to \(\deg\,\overline{\mathcal L}\) when counted with multiplicities and when some possible ``infinite solutions are taken into account. The results in Section 2 generalize mathematical ideas which have been developed for the static pole placement problem by \textit{R.W. Brockett} and \textit{C.I. Byrnes} [IEEE Trans. Autom. Control 26, 271--284 (1981; Zbl 0462.93026)] and for the dynamic pole placement problem by \textit{M.S. Ravi, J. Rosenthal} and \textit{X. Wang} [SIAM J. Control Optimization 32, No. 1, 279--296 (1994; Zbl 0797.93018); ibid. 34, No.3, 813--832 (1996; Zbl 0856.93043)]. In Section 3 the authors compute the degree of \(\overline{\mathcal L}\) in many special cases. As a corollary they rediscover several matrix completion results as they were derived earlier. Section 4 is concerned with the value of the ``generic degree; this is the largest possible degree of a variety \(\overline{\mathcal L}\) of fixed dimension can have. The authors determine an upper bound for the generic degree in the case when \(d= n\) and prove that this bound is reached when \(m= n< 5\).
- On the pole placement problem for linear systems of arbitrary genus
- On the solvability of polynomial systems arising in control
- Global asymptotic stabilization of autonomous bilinear complex systems
- Pole placement with fields of positive characteristic
- scientific article; zbMATH DE number 97560 (Why is no real title available?)
- Consistent systems and pole assignment: I
- Arbitrary matrix coefficient assignment for block matrix bilinear control systems in the Hessenberg form
- Zero assignment of matrix pencils by additive structured transformations
This page was built for publication: Pole Placement and Matrix Extension Problems: A Common Point of View
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652512)