Dynamical control of Newton's method for multiple roots of polynomials - Archive ouverte HAL
Article Dans Une Revue Reliable Computing Journal Année : 2016

Dynamical control of Newton's method for multiple roots of polynomials

Résumé

In this article, we show how to perform a dynamical control of Newton's method for the computation of multiple roots of polynomials. Using Discrete Stochastic Arithmetic, root approximations are computed until the difference between two successive approximations is numerical noise. With such a stopping criterion, the optimal number of iterations in Newton's method are performed. Moreover it is possible to estimate in the result obtained which digits are in common with the exact root. Two strategies to estimate the multiplicity of polynomials roots are compared: one requires root approximations computed at different precisions and the other three successive iterates of Newton's method. We show that using such a strategy and then the modified Newton's method, multiple roots can be computed with a requested accuracy.
Fichier principal
Vignette du fichier
article_HAL.pdf (496.51 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01363961 , version 1 (12-09-2016)

Identifiants

  • HAL Id : hal-01363961 , version 1

Citer

Stef Graillat, Fabienne Jézéquel, Moustadrani Saïd Ibrahim. Dynamical control of Newton's method for multiple roots of polynomials. Reliable Computing Journal, 2016, 21. ⟨hal-01363961⟩
187 Consultations
1599 Téléchargements

Partager

More