The standard H-infinity, problem for descriptor systems is solved by freque
ncy domain techniques relying on spectral factorization. An algorithm of Cl
ements for the spectral factorization of rational matrices is adapted to th
e descriptor problem. It leads to a compact and efficient solution that inv
olves transforming two suitable matrix pencils to Clements form.