A note on the complexity of univariate root isolation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2006

A note on the complexity of univariate root isolation

Résumé

This paper presents the average-case bit complexity of subdivision-based univariate solvers, namely those named after Sturm, Descartes, and Bernstein. By real solving we mean real root isolation. We prove bounds of $\sOB(N^5)$ for all methods, where $N$ bounds the polynomial degree and the coefficient bitsize, whereas their worst-case complexity is in $\sOB(N^6)$. In the case of the Sturm solver, our bound depends on the number of real roots. Our work is a step towards understanding the practical complexity of real root isolation. This enables a better juxtaposition against numerical solvers, the latter having worst-case complexity in $\sOB(N^4)$. % Our approach extends to complex root isolation, where we offer a simple proof leading to bounds % for the number of steps that the subdivision algorithm performs on the worst and average-case complexities of $\sOB(N^7 )$ and $\sOB(N^6)$ respectively, where the latter is output-sensitive.
Fichier principal
Vignette du fichier
RR-6043.pdf (242.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00116985 , version 1 (29-11-2006)
inria-00116985 , version 2 (30-11-2006)
inria-00116985 , version 3 (30-11-2006)
inria-00116985 , version 4 (04-12-2006)
inria-00116985 , version 5 (10-12-2006)

Identifiants

  • HAL Id : inria-00116985 , version 5

Citer

Ioannis Emiris, Elias P. P. Tsigaridas. A note on the complexity of univariate root isolation. [Research Report] RR-6043, INRIA. 2006, pp.18. ⟨inria-00116985v5⟩
177 Consultations
127 Téléchargements

Partager

Gmail Facebook X LinkedIn More