Related papers: Sturm Theorem and a Refinement of Vietoris Inequal…
In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in…
In this paper, we explain a procedure based on a classical result of Sturm that can be used to determine rigorously whether a given trigonometric polynomial is nonnegative in a certain interval or not. Many examples are given. This…
By the classical Sturm's theorem, the number of distinct real roots of a given real polynomial $f(x)$ within any interval $(a,b]$ can be expressed by the number of variations in the sign of the Sturm chain at the bounds. Through…
Sturm's Theorem is a fundamental 19th century result relating the number of real roots of a polynomial $f$ in an interval to the number of sign alternations in a sequence of polynomial division-like calculations. We provide a short direct…
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on…
In this work, a Vietoris type theorem for the positivity of sine and cosine sum for a particular sequence of real numbers is provided. In this connection, the positivity of a particular type of sine sum involving ratio of some parameters is…
Sturm's theorem (1829/35) provides an elegant algorithm to count and locate the real roots of any real polynomial. In his residue calculus (1831/37) Cauchy extended Sturm's method to count and locate the complex roots of any complex…
The classical Vietoris cosine inequality is refined by establishing a positive polynomial lower bound.
For the general monic cubic and quartic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities…
First, we show that Sturm algorithm and Sylvester algorithm, which compute the number of real roots of a given univariate polynomial, lead to two dual tridiagonal determinantal representations of the polynomial. Next, we show that the…
In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…
Recently the author established an improvement of the classical Vietoris sine inequality to include sine polynomials with non-monotone coefficients. In this paper two further improvements are presented admitting sine polynomials with…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
For dispersive Hamiltonian partial differential equations of order 2N+1, N integer, there are two criteria to analyse to examine the stability of small-amplitude, periodic travelling wave solutions to high-frequency perturbations. The first…
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…
We study the spectral polynomial of the Treibich-Verdier potential. Such spectral polynomial, which is a generalization of the classical Lame polynomial, plays fundamental roles in both the finite-gap theory and the ODE theory of Heun's…
We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…