We give a new bound for the number of recursive subdivisions in the Descartes method for polynomial real root isolation. Our proof uses Ostrowski’s theory of normal power series from 1950 which has so far been overlooked in the literature. We combine Ostrowski’s results with a theorem of Davenport from 1985 to obtain our bound. We also characterize normality of cubic polynomials by explicit conditions on their roots and derive a generalization of one of Ostrowski’s theorems
Article dans revue scientifique avec comité de lecture. internationale.International audienceThis pa...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (DMM), on...
AbstractWe give a new bound for the number of recursive subdivisions in the Descartes method for pol...
We give a new bound for the number of recursive subdivisions in the Descartes method for polynomial ...
We give a unified ("basis free") framework for the Descartes method for real root isolation of squar...
In this paper, we introduce a variant of the Descartes method to isolate the real roots of a square-...
We introduce a new algorithm denoted DSC2 to isolate the real roots of a univariate square-free poly...
In this paper, we introduce a variant of the Descartes method to isolate the real roots of a square-...
AbstractIf an open interval I contains a k-fold root α of a real polynomial f, then, after transform...
The improved bound bound that was claimed in an earlier version is removed, since there was an error...
If an open interval $I$ contains a $k$-fold root $\alpha$ of a real polynomial~$f$, then, after tran...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
It is well known that, in 1829, the French mathematician Jacques Charles Francois Sturm (1803-1855) ...
Article dans revue scientifique avec comité de lecture. internationale.International audienceThis pa...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (DMM), on...
AbstractWe give a new bound for the number of recursive subdivisions in the Descartes method for pol...
We give a new bound for the number of recursive subdivisions in the Descartes method for polynomial ...
We give a unified ("basis free") framework for the Descartes method for real root isolation of squar...
In this paper, we introduce a variant of the Descartes method to isolate the real roots of a square-...
We introduce a new algorithm denoted DSC2 to isolate the real roots of a univariate square-free poly...
In this paper, we introduce a variant of the Descartes method to isolate the real roots of a square-...
AbstractIf an open interval I contains a k-fold root α of a real polynomial f, then, after transform...
The improved bound bound that was claimed in an earlier version is removed, since there was an error...
If an open interval $I$ contains a $k$-fold root $\alpha$ of a real polynomial~$f$, then, after tran...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
It is well known that, in 1829, the French mathematician Jacques Charles Francois Sturm (1803-1855) ...
Article dans revue scientifique avec comité de lecture. internationale.International audienceThis pa...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (DMM), on...