Related papers: A Unified Approach to Computing the Zeros of Class…

Let $x_1$ and $x_k$ be the least and the largest zeros of the Laguerre or Jacobi polynomial of degree $k.$ We shall establish sharp inequalities of the form $x_1 <A, x_k >B,$ which are uniform in all the parameters involved. Together with…

We study the differential equation $ - (p(x) y')' + q(x) y' = \lambda y,$ where $p(x)$ is a polynomial of degree at most 2 and $q(x)$ is a polynomial of degree at most 1. This includes the classical Jacobi polynomials, Hermite polynomials,…

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…

We derive upper bounds for the smallest zero and lower bounds for the largest zero of Laguerre, Jacobi and Gegenbauer polynomials. Our approach uses mixed three term recurrence relations satisfied by polynomials corresponding to different…

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…

We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their…

Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…

We calculate the zeros of an exponential polynomial of three variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…

The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…

In this paper we obtain $L^1$-weighted norms of classical orthogonal polynomials (Hermite, Laguerre and Jacobi polynomials) in terms of the zeros of these orthogonal polynomials; these expressions are usually known as quadrature rules. In…

In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…

The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigen-vectors of the corresponding companion matrix. This approach, probably…

For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…

We derive inversion formulas involving orthogonal polynomials which can be used to find coefficients of differential equations satisfied by certain generalizations of the classical orthogonal polynomials. As an example we consider special…

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…

In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…

The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the…

We present a derivation of classical Hermite, Laguerre, and Jacobi orthogonal polynomials directly through the Gram-Schmidt orthogonization process. The derivation uses certain generalized Vandermonde determinants with entries defined by…

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…