Computing multiple roots of polynomials in stochastic arithmetic with Newton method and approximate GCD - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2021

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.
Fichier principal
Vignette du fichier
article_Newton_GCD.pdf (447.26 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03274453 , version 1 (30-06-2021)
hal-03274453 , version 2 (23-07-2021)

Identifiants

  • HAL Id : hal-03274453 , version 1

Citer

Stef Graillat, Fabienne Jézéquel, Enzo Queiros Martins, Maxime Spyropoulos. Computing multiple roots of polynomials in stochastic arithmetic with Newton method and approximate GCD. 2021. ⟨hal-03274453v1⟩
306 Consultations
366 Téléchargements

Partager

More