An algorithm for computing a unimodular matrix U(λ) satisfying the equation [A(λ) B(λ)] U(λ) = [1 0] is presented where A(λ) and B(λ) are relatively left prime polynomial matrices. The approach used avoids Euclidean-type operations used in standard Gaussian elimination and thus appears to be superior to any direct approach based on the computation of Smith forms.