DOIAbstract
Several algorithms are known to separate the real zeros of a polynomial. In his thesis Heindel showed, that the computing time of his algorithm using Sturm sequences is polynomially bounded in the length of the coefficients. ..
Several algorithms are known to separate the real zeros of a polynomial. In his thesis Heindel showed, that the computing time of his algorithm using Sturm sequences is polynomially bounded in the length of the coefficients. ..
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
AbstractThis paper revisits an algorithm isolating the real roots of a univariate polynomial using D...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Several algorithms are known to separate the real zeros of a polynomial. In his thesis Heindel showe...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is a...
AbstractIn this paper, algorithms to enumerate and isolate complex polynomial roots are developed, a...
AbstractWe show two simple algorithms for isolation of the real and nearly real zeros of a univariat...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
Article dans revue scientifique avec comité de lecture. internationale.International audienceThis pa...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
AbstractThis paper revisits an algorithm isolating the real roots of a univariate polynomial using D...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Several algorithms are known to separate the real zeros of a polynomial. In his thesis Heindel showe...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is as...
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is a...
AbstractIn this paper, algorithms to enumerate and isolate complex polynomial roots are developed, a...
AbstractWe show two simple algorithms for isolation of the real and nearly real zeros of a univariat...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
Article dans revue scientifique avec comité de lecture. internationale.International audienceThis pa...
The simplest sure-fire way to approximate the real zeros of a real polynomial is to use Sturm's theo...
AbstractThis paper revisits an algorithm isolating the real roots of a univariate polynomial using D...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Add to ORKG