Computing multiple roots of polynomials in stochastic arithmetic with Newton method and approximate GCD
Résumé
In this article, we propose new methods to compute multiple roots of polynomials in floating-point arithmetic. We rely on stochastic arithmetic that makes it possible to deal with rounding errors. We develop the concept of stochastic GCD that we use to deflate a polynomial in order to obtain a polynomial with single roots. We can then apply Newton method to get fast and accurate approximations of the roots. Numerical experiments show the effectiveness and efficiency of our methods.
Origine | Fichiers produits par l'(les) auteur(s) |
---|