Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Symbolic Computation Year : 2022

Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces


The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. One of the challenges that it poses is to expand the currently limited range of random polynomials that we can handle. Despite important recent progress, the available tools cannot handle random sparse polynomials and Gaussian polynomials, that is polynomials whose coefficients are i.i.d. Gaussian random variables. We initiate a condition-based complexity framework based on the norm of the cube that is a step in this direction. We present this framework for real hypersurfaces and univariate polynomials. We demonstrate its capabilities in two problems, under very mild probabilistic assumptions. On the one hand, we show that the average run-time of the Plantinga-Vegter algorithm is polynomial in the degree for random sparse (alas a restricted sparseness structure) polynomials and random Gaussian polynomials. On the other hand, we study the size of the subdivision tree for Descartes' solver and run-time of the solver by Jindal and Sagraloff (2017). In both cases, we provide a bound that is polynomial in the size of the input (size of the support plus logarithm of the degree) for not only on the average, but all higher moments. [This is the journal version of the conference paper with the same title.]
Fichier principal
Vignette du fichier
Condition_Numbers_for_the_Cube__I__Univariate_Polynomials_and_Hypersurfaces (2).pdf (322.66 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03086875 , version 1 (22-12-2020)



Josué Tonelli-Cueto, Elias Tsigaridas. Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces. Journal of Symbolic Computation, inPress, 115, pp.142-173. ⟨10.1016/j.jsc.2022.08.013⟩. ⟨hal-03086875⟩
57 View
102 Download



Gmail Mastodon Facebook X LinkedIn More