Abstract. In a recent article, a complete discrimination system was given for a polynomial with symbolic/literal coefficients. Such a system is a set of explicit expressions in terms of the coefficients, which is sufficient for determining the numbers and multiplicities of the real and imaginary roots. Sometimes, however, one wants to know the number of roots in a certain range, especially, in a interval. We give here an explicit criterion to determine the number of positive roots of a real polynomial, and hence an efficient algorithm is introduced for determining the number of roots in a general interval. 1
AbstractAn improved algorithm, together with its implementation, is presented for the automatic comp...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
AbstractThis paper revisits an algorithm isolating the real roots of a univariate polynomial using D...
AbstractAn explicit criterion for the determination of the numbers and multiplicities of the real/im...
AbstractThe problem of finding the number of roots of a polynomial ƒ(z = x + iy) satisfying a given ...
The aim of this paper is to study the roots of interval polynomials. The characterization of such ro...
W pracy zaprezentowałam algorytmy, za pomocą których można obliczyć liczbę rzeczywistych pierwiastkó...
AbstractIn this paper, we develop a rigorous algorithm for counting the real interval zeros of polyn...
This paper presents a formally verified decision procedure for determinining the satisfiability of a...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
It is well known that, in 1829, the French mathematician Jacques Charles Francois Sturm (1803-1855) ...
Graduation date: 1986This is an interactive, self explanatory computer\ud program on real roots of p...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
AbstractThis paper deals with the localization of all the real roots of sine-polynomials. D. Richard...
AbstractWe give a complete set of discriminatory criteria for a polynomial with five parameters to h...
AbstractAn improved algorithm, together with its implementation, is presented for the automatic comp...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
AbstractThis paper revisits an algorithm isolating the real roots of a univariate polynomial using D...
AbstractAn explicit criterion for the determination of the numbers and multiplicities of the real/im...
AbstractThe problem of finding the number of roots of a polynomial ƒ(z = x + iy) satisfying a given ...
The aim of this paper is to study the roots of interval polynomials. The characterization of such ro...
W pracy zaprezentowałam algorytmy, za pomocą których można obliczyć liczbę rzeczywistych pierwiastkó...
AbstractIn this paper, we develop a rigorous algorithm for counting the real interval zeros of polyn...
This paper presents a formally verified decision procedure for determinining the satisfiability of a...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
It is well known that, in 1829, the French mathematician Jacques Charles Francois Sturm (1803-1855) ...
Graduation date: 1986This is an interactive, self explanatory computer\ud program on real roots of p...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
AbstractThis paper deals with the localization of all the real roots of sine-polynomials. D. Richard...
AbstractWe give a complete set of discriminatory criteria for a polynomial with five parameters to h...
AbstractAn improved algorithm, together with its implementation, is presented for the automatic comp...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
AbstractThis paper revisits an algorithm isolating the real roots of a univariate polynomial using D...