Add to ORKGWe propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given by means of a coefficient oracle. For a given positive integer $L$, our algorithm returns disjoint disks $\Delta_{1},\ldots,\Delta_{s}\subset\mathbb{C}$, with $s<2k$, centered at the real axis and of radius less than $2^{-L}$ together with positive integers $\mu_{1},\ldots,\mu_{s}$ such that each disk $\Delta_{i}$ contains exactly $\mu_{i}$ roots of $f$ counted with multiplicity. In addition, it is ensured that each real root of $f$ is contained in one of the disks. If $f$ has only simple real roots, our a...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is a...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
Abstract. We present a deterministic 2O(t)q t−2 t−1+o(1) algorithm to decide whether a uni-variate p...
We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x...
Let p∈Z[x] be an arbitrary polynomial of degree n with k non-zero integer coefficients of absolute v...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
We consider a univariate polynomial f with real coecients having a high degree N but a rather small ...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
The problem of computing the roots of a particular sequence of sparse polynomials pn(t) is considere...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
8 double pages.International audienceWe consider a univariate polynomial f with real coefficients ha...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
The problem of computing the roots of a particular sequence of sparse polynomials pn(t) is considere...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is a...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
Abstract. We present a deterministic 2O(t)q t−2 t−1+o(1) algorithm to decide whether a uni-variate p...
We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x...
Let p∈Z[x] be an arbitrary polynomial of degree n with k non-zero integer coefficients of absolute v...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
We consider a univariate polynomial f with real coecients having a high degree N but a rather small ...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
The problem of computing the roots of a particular sequence of sparse polynomials pn(t) is considere...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
8 double pages.International audienceWe consider a univariate polynomial f with real coefficients ha...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
The problem of computing the roots of a particular sequence of sparse polynomials pn(t) is considere...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is a...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
Abstract. We present a deterministic 2O(t)q t−2 t−1+o(1) algorithm to decide whether a uni-variate p...