Efficient Isolation of a Polynomial Real Roots - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

Efficient Isolation of a Polynomial Real Roots

Résumé

This paper gives new results for the isolation of real roots of a univariate polynomial using Descartes' rule of signs, following work of Vincent, Uspensky, Collins and Akritas, Johnson, Krandick. The first contribution is a generic algorithm which enables one to describe all the existing strategies in a unified framework. Using that framework, a new algorithm is presented, which is optimal in terms of memory usage, while doing no more computations than other algorithms based on Descartes' rule of signs. We show that these critical optimizations have important consequences by proposing a full efficient solution for isolating the real roots of zero-dimensional polynomial systems.
Fichier principal
Vignette du fichier
RR-4113.pdf (343.5 Ko) Télécharger le fichier

Dates et versions

inria-00072518 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00072518 , version 1

Citer

Fabrice Rouillier, Paul Zimmermann. Efficient Isolation of a Polynomial Real Roots. [Research Report] RR-4113, INRIA. 2001. ⟨inria-00072518⟩
374 Consultations
904 Téléchargements

Partager

Gmail Facebook X LinkedIn More