Highly Influenced

# When are Two Numerical Polynomials Relatively Prime?

@article{Beckermann1998WhenAT, title={When are Two Numerical Polynomials Relatively Prime?}, author={Bernhard Beckermann and George Labahn}, journal={J. Symb. Comput.}, year={1998}, volume={26}, pages={677-689} }

- Published 1998 in J. Symb. Comput.
DOI:10.1006/jsco.1998.0234

Let a and b be two polynomials having numerical coeecients. We consider the question: when are a and b relatively prime? Since the coeecients of a and b are approximant, the question is the same as: when are two polynomials relatively prime, even after small perturbations of the coeecients? In this paper we provide a numeric parameter for determining that two polynomials are prime, even under small perturbations of the coeecients. Our methods rely on an inversion formula for Sylvester matricesâ€¦Â CONTINUE READING