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}
}
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

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Certi ed approximate univariate GCDs

  • I. Emiris, A. Galligo, H. Lombardi
  • J. Pure and Applied Algebra, 117
  • 1997
3 Excerpts

A weakly stable Algorithm for Pad e Approximants and the Inversion of Hankel matrices

  • S. Cabay, R. Meleshko
  • SIAM J. Matrix Analysis and Applications 14
  • 1993
2 Excerpts

Approximate GCD and its applications to ill{conditioned algebraic equations, J.CAM

  • M.-T. Noda, T. Sasaki
  • 1991
2 Excerpts

Similar Papers

Loading similar papers…