相关论文: Interlacing of zeros of polynomials completed with…
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…
In this manuscript, new algebraic and analytic aspects of the orthogonal polynomials satisfying $R_{II}$ type recurrence relation given by \begin{align*} \mathcal{P}_{n+1}(x) = (x-c_n)\mathcal{P}_n(x)-\lambda_n…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
We prove several results about zeros of paraorthogonal polynomials using the theory of rank one perturbations of unitary operators. In particular, we obtain new details on the interlacing of zeros for successive POPUC.
For $0<\alpha<1$, we study the zeros of the sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $(1-t)^{\alpha}(1-2zt+t^{2})$, expanded as a power series in $t$. Equivalently, this sequence is…
We state and prove the $q$-extension of a result due to Johnston and Jordaan (cf. \cite{Johnston-2015}) and make use of this result, the orthogonality of $q$-Laguerre, little $q$-Jacobi, $q$-Meixner and Al-Salam-Carlitz I polynomials as…
Necessary and sufficient conditions for the interlacing of the zeros of cylinder functions and their derivatives of different orders are 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…
In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…
In this paper we consider connection formulae for orthogonal polynomials in the context of Christoffel transformations for the case where a weight function, not necessarily even, is multiplied by an even function $c_{2k}(x),k\in N_0$, to…
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…
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…
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 study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…
We identify a class of remarkable algebraic relations satisfied by the zeros of the Krall orthogonal polynomials that are eigenfunctions of linear differential operators of order higher than two. Given an orthogonal polynomial family…
In this paper, we provide a simple proof of a generalization of the Gauss-Lucas theorem. By using methods of D-companion matrix, we get the majorization relationship between the zeros of convex combinations of incomplete polynomials and an…
We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…
In this paper, we introduce a new family of symmetric polynomials which depends on a parameter r. They are defined by specifying certain of their zeros. For the parameter values 1/2, 1, and 2 they have an interpretation in terms of Capelli…
In this note we present an infinite family of 2-connected graphs such that their matching polynomials have only integer zeros. This answers in negative a question of Akbari et al. [Graphs with integer matching polynomial zeros, Discrete…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…