 |
|
|
|
| HAL : hal-00186254, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
|
|
| Accurate simple zeros of polynomials in floating point arithmetic |
|
|
| Stef Graillat 1 |
|
|
| (08/11/2007) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Paris 6 (LIP6) |
|
|
|
CNRS : UMR7606 – Université Paris VI - Pierre et Marie Curie |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Analyse numérique Informatique/Logiciel mathématique |
|
|
| zeros of polynomials – Newton's method – condition number – floating point arithmetic |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00186254, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00186254 | |
| oai:hal.archives-ouvertes.fr:hal-00186254 | |
| Contributeur : Stef Graillat | |
| Soumis le : Jeudi 8 Novembre 2007, 14:53:44 | |
| Dernière modification le : Jeudi 8 Novembre 2007, 14:59:07 | |
