Beyond Worst-Case Analysis for Root Isolation Algorithms

DOI10.1145/3476446.3535475MaRDI QIDQ6391011zbMATH OpenWikidataFDO

Authors Alperen Ali Ergur, Josué Tonelli-Cueto, Elias P. Tsigaridas

Publication date 13 February 2022

Full work available at URL https://doi.org/10.1145/3476446.3535475

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Numerical computation of roots of polynomial equations (65H04) Symbolic computation and algebraic computation (68W30)

Abstract: 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 $widetilde{mathcalO}_B(d^2+dau)$, where $d$ is the degree of the polynomial and $au$ the bitsize of the coefficients.

This page was built for publication: Beyond Worst-Case Analysis for Root Isolation Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6391011)