An algorithm for coprime matrix fraction description using sylvester matrices

Several algorithms for the computation of coprime matrix fraction descriptions have been proposed in the past. Here we explore some of the properties of Sylvester matrices and develop a different approach to the problem which is based on singular value decompositions and therefore avoids problems of numerical ill-conditioning.