Accurate simple zeros of polynomials in floating point arithmetic
Résumé
In the paper, we examine the behavior of the Newton's method in floating point arithmetic for the computation of a simple zero of a polynomial. We allow an extended precision (twice the working precision) in the computation of the residual. We prove that, for a sufficient number of iteration, the zero is as accurate as if computed in twice the working precision. We provides numerical experiments confirming this.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...