Generalised resultants, dynamic polynomial combinants and the minimal design problem
Generalised resultants, dynamic polynomial combinants and the minimal design problem
The theory of dynamic polynomial combinants is linked to the linear part of the dynamic determinantal assignment problems (DAP), which provides the unifying description of the dynamic, as well as static pole and zero dynamic assignment problems in linear systems. The assignability of spectrum of polynomial combinants provides necessary conditions …