For this routine two examples are presented, both of which involve computing the singular value decomposition of a matrix $A$, where in the first example and in the second. $A$ must first be reduced to tridiagonal form by zgebrd. The program then calls zungbr twice to form $Q$ and $P^{\mathrm{H}}$, and passes these matrices to zbdsqr, which computes the singular value decomposition of $A$.