Affiliation:
1. Western University, London, Canada
Abstract
In general, finding the Greatest Common Divisor (GCD) of two exactly-known univariate polynomials is a well understood problem. However, it is also known that the GCD problem for
noisy
polynomials (polynomials with errors in their coefficients) is ill-posed. More precisely, a small error in coefficients of polynomials
P
and
Q
with a non-trivial GCD generically leads to a constant GCD. We note that the choice of basis makes no difference to this difficulty.
Publisher
Association for Computing Machinery (ACM)
Reference19 articles.
1. When are Two Numerical Polynomials Relatively Prime?
2. On rational functions without Froissart doublets
3. Bini and Ana Marco, Computing curve intersection by means of simultaneous iterations;Dario;Numerical Algorithms,2006
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximate GCD by bernstein basis, and its applications;Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation;2020-07-20
2. The Computation of Multiple Roots of a Bernstein Basis Polynomial;SIAM Journal on Scientific Computing;2020-01