On zeros of discrete orthogonal polynomials

We exploit difference equations to establish sharp inequalities on the extreme zeros of the classical discrete orthogonal polynomials, Charlier, Krawtchouk, Meixner and Hahn. We also provide lower bounds on the minimal distance between their consecutive zeros.     

Structure relations for monic orthogonal polynomials in two discrete variables

In this paper, extensions of several relations linking differences of bivariate discrete orthogonal polynomials and polynomials themselves are given, by using an appropriate vector–matrix notation. Three-term recurrence relations are presented for the partial differences of the monic polynomial solutions of admissible second order partial difference equation of hypergeometric type. Structure relations, difference representations as well as lowering and raising operators are obtained. Finally, expressions for all matrix coefficients appearing in these finite-type relations are explicitly presented for a finite set of Hahn and Kravchuk orthogonal polynomials.     

Computing orthogonal polynomials on a triangle by degree raising

We give an algorithm for computing orthogonal polynomials over triangular domains in Bernstein–Bézier form which uses only the operator of degree raising and its adjoint. This completely avoids the need to choose an orthogonal basis (or tight frame) for the orthogonal polynomials of a given degree, and hence the difficulties inherent in that approach. The results are valid for Jacobi polynomials on a simplex, and show the close relationship between the Bernstein form of Jacobi polynomials, Hahn polynomials and degree raising.     

A finite sequence of Hahn-type discrete orthogonal polynomials

ABSTRACT

By considering a specific Sturm–Liouville problem, we introduce a finite sequence of Hahn-type discrete polynomials and prove that they are finitely orthogonal on the real line. We then compute their norm square value by using Dougall's bilateral sum and obtain all moments corresponding to the introduced polynomials.     

Two finite hypergeometric sequences of discrete orthogonal polynomials

Two finite hypergeometric sequences of symmetric orthogonal polynomials of a discrete variable are introduced and their standard properties, such as second-order difference equations, explicit forms of the polynomials and three term recurrence relations are obtained. As a consequence of two specific Sturm–Liouville problems, it is proved that these polynomials are finitely orthogonal with respect to two symmetric weight functions.     

Approximation of discrete functions and Chebyshev polynomials orthogonal on the uniform grid

Let _N+2m ={−m, −m+1, …, −1, 0, 1, …,N−1,N, …,N−1+m}. The present paper is devoted to the approximation of discrete functions of the formf : _N+2m → ℝ by algebraic polynomials on the grid Ω _N ={0, 1, …,N−1}. On the basis of two systems of Chebyshev polynomials orthogonal on the sets Ω _N+m and Ω _N , respectively, we construct a linear operatorY _{n+2m, N} =Y _{n+2m, N} (f), acting in the space of discrete functions as an algebraic polynomial of degree at mostn+2m for which the following estimate holds (x ε Ω _N ):

Asymptotics of orthogonal polynomials with asymptotic Freud-like weights

We derive uniform asymptotic expansions for polynomials orthogonal with respect to a class of weight functions that are real analytic and behave asymptotically like the Freud weight at infinity. Although the limiting zero distributions are the same as in the Freud cases, the asymptotic expansions are different due to the fact that the weight functions may have a finite or infinite number of zeros on the imaginary axis. To resolve the singularities caused by these zeros, an auxiliary function is introduced in the Riemann–Hilbert analysis. Asymptotic formulas are established in several regions covering the whole complex plane. We take the continuous dual Hahn polynomials as an example to illustrate our main results. Some numerical verifications are also given.     

On some properties of q-Hahn multiple orthogonal polynomials

This contribution deals with multiple orthogonal polynomials of type II with respect to q-discrete measures (q-Hahn measures). In addition, we show that this family of multiple orthogonal polynomials has a lowering operator, and raising operators, as well as a Rodrigues type formula. The combination of lowering and raising operators leads to a third order q-difference equation when two orthogonality conditions are considered. An explicit expression of this q-difference equation will be given. Indeed, this q-difference equation relates polynomials with a given degree evaluated at four consecutive non-uniformed distributed points, which makes these polynomials interesting from the point of view of bispectral problems.     

Relative asymptotics and Fourier series of orthogonal polynomials with a discrete Sobolev inner product

Let μ be a finite positive Borel measure supported in [−1,1] and introduce the discrete Sobolev-type inner product

where the mass points a_k belong to [−1,1], M_k,i0, i=0,…,N_k−1, and M_k,Nk>0. In this paper, we study the asymptotics of the Sobolev orthogonal polynomials by comparison with the orthogonal polynomials with respect to the measure μ and we prove that they have the same asymptotic behaviour. We also study the pointwise convergence of the Fourier series associated to this inner product provided that μ is the Jacobi measure. We generalize the work done by F. Marcellán and W. Van Assche where they studied the asymptotics for only one mass point in [−1,1]. The same problem with a finite number of mass points off [−1,1] was solved by G. López, F. Marcellán and W. Van Assche in a more general setting: they consider the constants M_k,i to be complex numbers. As regards the Fourier series, we continue the results achieved by F. Marcellán, B. Osilenker and I.A. Rocha for the Jacobi measure and mass points in .     

Construction of polynomials that are orthogonal with respect to a discrete bilinear form

We describe a new algorithm for the computation of recursion coefficients of monic polynomials {p _j } _j ^=0/n that are orthogonal with respect to a discrete bilinear form (f, g) := _k ^=1/m f(x _k )g(x _k )w _k ,m n, with real distinct nodesx _k and real nonvanishing weightsw _k . The algorithm proceeds by applying a judiciously chosen sequence of real or complex Givens rotations to the diagonal matrix diag[x ₁,x ₂, ...,x _m ] in order to determine an orthogonally similar complex symmetric tridiagonal matrixT, from whose entries the recursion coefficients of the monic orthogonal polynomials can easily be computed. Fourier coefficients of given functions can conveniently be computed simultaneously with the recursion coefficients. Our scheme generalizes methods by Elhay et al. [6] based on Givens rotations for updating and downdating polynomials that are orthogonal with respect to a discrete inner product. Our scheme also extends an algorithm for the solution of an inverse eigenvalue problem for real symmetric tridiagonal matrices proposed by Rutishauser [20], Gragg and Harrod [17], and a method for generating orthogonal polynomials based theoron [18]. Computed examples that compare our algorithm with the Stieltjes procedure show the former to generally yield higher accuracy except whenn m. Ifn is sufficiently much smaller thanm, then both the Stieltjes procedure and our algorithm yield accurate results.Research supported in part by the Center for Research on Parallel Computation at Rice University and NSF Grant No. DMS-9002884.     

Constrained energy problems with applications to orthogonal polynomials of a discrete variable

Given a positive measure Σ with gs > 1, we write Με ℳ^Σ if Μ is a probability measure and Σ—Μ is a positive measure. Under some general assumptions on the constraining measure Σ and a weight functionw, we prove existence and uniqueness of a measure λ^Σ _w that minimizes the weighted logarithmic energy over the class ℳ^Σ. We also obtain a characterization theorem, a saturation result and a balayage representation for the measure λ^Σ _w As applications of our results, we determine the (normalized) limiting zero distribution for ray sequences of a class of orthogonal polynomials of a discrete variable. Explicit results are given for the class of Krawtchouk polynomials. The research done by this author is in partial fulfillment of the Ph.D. requirements at the University of South Florida. The research done by this author was supported, in part, by U.S. National Science Foundation under grant DMS-9501130.     

Nonlinear equations for the recurrence coefficients of discrete orthogonal polynomials

We study polynomials orthogonal on a uniform grid. We show that each weight function gives two potentials and each potential leads to a structure relation (lowering operator). These results are applied to derive second order difference equations satisfied by the orthogonal polynomials and nonlinear difference equations satisfied by the recursion coefficients in the three-term recurrence relations.     

On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method

In this paper we explore two sets of polynomials, the orthogonal polynomials and the residual polynomials, associated with a preconditioned conjugate gradient iteration for the solution of the linear system Ax = b. In the context of preconditioning by the matrix C, we show that the roots of the orthogonal polynomials, also known as generalized Ritz values, are the eigenvalues of an orthogonal section of the matrix C A while the roots of the residual polynomials, also known as pseudo-Ritz values (or roots of kernel polynomials), are the reciprocals of the eigenvalues of an orthogonal section of the matrix (C A)^?1. When C A is selfadjoint positive definite, this distinction is minimal, but for the indefinite or nonselfadjoint case this distinction becomes important. We use these two sets of roots to form possibly nonconvex regions in the complex plane that describe the spectrum of C A.     

On a set of orthogonal polynomials associated with a quantized physical model

In this paper we investigate a set of orthogonal polynomials. We relate the polynomials to the Biconfluent Heun equation and present an explicit expression for the polynomials in terms of the classical Hermite polynomials. The orthogonality with a varying measure and the recurrence relation are also presented.     

A proof of a conjecture about a symmetric system of orthogonal polynomials

ABSTRACT

The purpose of this note is to give an affirmative answer to a conjecture appearing in Berg [Open problems. Integral Transforms Spec Funct. 2015;26(2):90–95].     

Characterization of semi-classical orthogonal polynomials on nonuniform lattices

We state and prove characterization theorem for semi-classical orthogonal polynomials on nonuniform lattices (quadratic lattices of a discrete or q-discrete variable). This theorem proves the equivalence between the four characterization properties, namely, the Pearson type equation for the linear functional, the strictly quasi-orthogonality of the derivatives, the structure relation, and the Riccati equation for the formal Stieltjes function. We give the classification of the semi-classical linear functional of class one on nonuniform lattice. Using the definition and the properties of the associated orthogonal polynomials, we prove that semi-classical orthogonal polynomials satisfy the second-order divided difference equation on nonuniform lattices.