Frequency domain solution of the H_ problem for descriptor systems

From MaRDI portal
Publication:4227166





In this paper one considers a generalized plant which is characterized by the descriptor equations: \[ E\dot x= Ax+ B_1w+ B_2u,\quad z= C_1x+ D_{11}w+ D_{12}u,\quad y= C_2x+ D_{21}w+ D_{22} u. \] Such a descriptor representation of the generalized plant is more flexible than the state representation in order to define practical \(H_\infty\) problems. The \(H_\infty\) problem for descriptor systems is solved by using the frequency domain techniques. The author applies an algorithm of Clements for the spectral factorization of rational matrices which is adapted to the descriptor problem. By the technique used two matrix pencils are transformed to Clements form. For the entire collection see [Zbl 0901.00020].











This page was built for publication: Frequency domain solution of the \({\mathcal H}_\infty\) problem for descriptor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227166)