Recursive Algorithms for Coprime Fractions and Diophantine Equations

The computation of coprime fractions for proper rational matrices and the solving of Diophantine equations are important in the design of multivariable systems by using polynomial fractional forms. Recursive algorithms, which fully exploit the shift-invariant property of the generalized resultants, are developed to carry out these computations. They are more efficient than the existing ones.