Related papers: Bounds for the zeros of Bicomplex Polynomials usin…
The main aim of this work is to apply the study of the asymptotic behaviour of generalized eigenvalues between infinite Hermitian definite positive matrices in an important question regarding the location of zeros of Sobolev orthogonal…
Classically, the Bezout matrix or simply Bezoutian of two polynomials is used to locate the roots of the polynomial and, in particular, test for stability. In this paper, we develop the theory of Bezoutians on real Riemann surfaces of…
In this paper we investigate the distribution of zeros of Boubaker polynomials.
Integral Cauchy theorem is used to derive closed-form expressions of the roots of a univariate polynomial of any degree as integrals of elementary functions.
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…
Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…
We show that the dilogarithm has at most one zero on each branch, that each zero is close to a root of unity, and that they may be found to any precision with Newton's method. This work is motivated by applications to the asymptotics of…
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given…
A new numerical method is introduced for calculation of quasi-polynomial zeros with constant single delay. The trajectories of zeros are obtained depending on time-delay from zero to final time-delay value. The method determines all the…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.
Ercolani and McLaughlin have recently shown that the zeros of the bi-orthogonal polynomials with the weight $w(x,y)=\exp[-(V_1(x)+V_2(y)+2cxy)/2]$, relevant to a model of two coupled hermitian matrices, are real and simple. We show that…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
In this paper, we obtain a Schwartz-Zippel type estimate for homogenous finite field polynomials. Specifically, we use a probabilistic recursion technique to find upper and lower bounds for the number of zeros of a homogenous polynomial and…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…
We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…
We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…