 |
|
| HAL: hal-00583139, version 1 |
| Detailed view |  Export this paper |
 |
|
|
| Efficient root counting for analytic functions on a disk |
|
|
| Joris Van Der Hoeven 1 |
|
|
| For the MaGiX collaboration(s) |
|
|
| (2011-04-04) |
|
|
|
| In this note, we present a variant of an algorithm by Schönhage for counting the number of zeros of a complex polynomial in a disk. Our algorithm implements a few optimizations and also applies to more general analytic functions. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique de l'école polytechnique (LIX) |
|
|
|
CNRS : UMR7161 – Polytechnique - X |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Mathematical Software |
|
|
| Root counting – reliable computation – Graeffe method |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00583139, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00583139 | |
| oai:hal.archives-ouvertes.fr:hal-00583139 | |
| From: Joris Van Der Hoeven | |
| Submitted on: Monday, 4 April 2011 22:56:02 | |
| Updated on: Tuesday, 5 April 2011 09:29:47 | |
