A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845)

This interesting paper extends the Cabay-Meleshko algorithm for Padé approximation. It provides a fast and numerically stable algorithm to determine when two given polynomials \(p\) and \(q\) are relatively prime and remain relatively prime even after small perturbations of their coefficients. The authors also discuss possible extensions of their approach that can be applied to the problem of actually computing a numerical greatest common divisor.