The output zeroing problem for general polynomial matrix descriptions
The authors consider a linear system of the form \[ A\biggl( \frac{d}{dt} \biggr) \beta(t)= B\biggl( \frac{d}{dt} \biggr) u(t), \qquad y(t)= C\biggl( \frac{d}{dt} \biggr) \beta(t)+ D\biggl( \frac{d}{dt} \biggr) u(t), \] with \(A\), \(B\), \(C\) and \(D\) polynomials. For a system of this type they characterize those pairs \((\beta(\cdot), u(\cdot))\) such that \(y\equiv 0\). The characterization of this set is done via the finite and infinite zeros of the polynomial matrix \(\left( \begin{smallmatrix} A(s) &B(s)\\ -C(s) &D(s) \end{smallmatrix} \right)\).
- Approximate zero polynomials of polynomial matrices and linear systems
- Matrix zeros of polynomials
- scientific article; zbMATH DE number 842862
- A composite polynomial zerofinding matrix algorithm
- Regularization and zero assignment of rectangular polynomial matrices
- Determining the coefficients of zero polynomials from output controllability matrices
- Polynomial zerofinding iterative matrix algorithms
- scientific article; zbMATH DE number 4187997
- An Optimization Framework for Polynomial Zerofinders
- Zero-degree solutions to the bilateral polynomial matrix equations
This page was built for publication: The output zeroing problem for general polynomial matrix descriptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955097)
