Frequency domain solution of the H problem for descriptor systems

The standard H ∞ problem for descriptor systems is solved by frequency domain techniques relying on spectral factorization. An algorithm of Clements for the spectral factorization of rational matrices is adapted to the descriptor problem. It leads to a compact and efficient solution that involves transforming two suitable matrix pencils to Clements form.