Beyond Worst-Case Analysis for Root Isolation Algorithms - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Beyond Worst-Case Analysis for Root Isolation Algorithms

Résumé

Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous ingenious algorithms and furnishes an active area of research. However, the worst-case analysis of root-finding algorithms does not correlate with their practical performance. We develop a smoothed analysis framework for polynomials with integer coefficients to bridge the gap between the complexity estimates and the practical performance. In this setting, we derive that the expected bit complexity of Descartes solver to isolate the real roots of a polynomial, with coefficients uniformly distributed, is ÕB(d2 + dτ), where d is the degree of the polynomial and τ the bitsize of the coefficients.
Fichier principal
Vignette du fichier
2202.06428(3).pdf (869.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03575449 , version 1 (25-07-2022)

Identifiants

Citer

Alperen A. Ergür, Josué Tonelli-Cueto, Elias Tsigaridas. Beyond Worst-Case Analysis for Root Isolation Algorithms. ISSAC '22 - International Symposium on Symbolic and Algebraic Computation, Jul 2022, Villeneuve-d'Ascq, France. ⟨hal-03575449⟩
36 Consultations
21 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More