Recurrence Relations for the Coefficients in Series Expansions with Respect to Semi-Classical Orthogonal Polynomials

Let {P _k } be a sequence of the semi-classical orthogonal polynomials. Given a function f satisfying a linear second-order differential equation with polynomial coefficients, we describe an algorithm to construct a recurrence relation satisfied by the coefficients a _k [f] in f= _k a _k [f]P _k . A systematic use of basic properties (including some nonstandard ones) of the polynomials {P _k } results in obtaining a recurrence of possibly low order. Recurrences for connection or linearization coefficients related to the first associated generalized Gegenbauer, Bessel-type and Laguerre-type polynomials are given explicitly.     

On the recurrence coefficients of the generalized little q-Laguerre polynomials

In this paper we consider a semi-classical variation of the weight related to the little q-Laguerre polynomials and obtain a second order second degree discrete equation for the recurrence coefficients in the three-term recurrence relation.     

Connection coefficients, orthogonal polynomials and the WZ-algorithms

In this paper we explore the relationship between the coefficients in the expansion of a function f(x) in orthogonal polynomials and the coefficients for the expansion of (1-x) ^m f(x), with particular attention to the case of Jacobi polynomials. Such problems arise frequently in computational chemistry. The analysis of the situation is substantially assisted by the use of two of the so-called Wilf-Zeilberger algorithms: the algorithm zeil and the algorithm hyper. We explain these algorithms and give several examples. This revised version was published online in June 2006 with corrections to the Cover Date.     

On orthogonal polynomials with respect to the form -(x - c)S'

Summary A form (linear functional) $u$ is called regular if we can associate with it a sequence of monic orthogonal polynomials. On certain regularity conditions, the product of a non regular form by a polynomial can be regular. The purpose of this work is to establish regularity conditions of the form $-(x-c){\mathbf S}',$ where ${\mathbf S}$ is a classical (Bessel, Jacobi). We give the second-order recurrence relations and structure relations of its corresponding orthogonal polynomial sequence. We conclude with an example as an illustration.     

Some classes of special functions using Fourier transforms of some two-Variable orthogonal polynomials

ABSTRACT

In this paper some new classes of two-variable orthogonal functions by using Fourier transforms of two-variable orthogonal polynomials are introduced. Orthogonality relations are obtained by using the Parseval identity. Recurrence relations for new families of orthogonal functions are also presented.     

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.     

Zeros of a family of hypergeometric para‐orthogonal polynomials on the unit circle

Para‐orthogonal polynomials derived from orthogonal polynomials on the unit circle are known to have all their zeros on the unit circle. In this note we study the zeros of a family of hypergeometric para‐orthogonal polynomials. As tools to study these polynomials, we obtain new results which can be considered as extensions of certain classical results associated with three term recurrence relations and differential equations satisfied by orthogonal polynomials on the real line. One of these results which might be considered as an extension of the classical Sturm comparison theorem, enables us to obtain monotonicity with respect to the parameters for the zeros of these para‐orthogonal polynomials. Finally, a monotonicity of the zeros of Meixner‐Pollaczek polynomials is proved.     

Moment representations of the exceptional X1‐Laguerre orthogonal polynomials

Exceptional orthogonal Laguerre polynomials can be viewed as an extension of the classical Laguerre polynomials per excluding polynomials of certain order(s) from being eigenfunctions for the corresponding exceptional differential operator. We are interested in the (so‐called) Type I X₁‐Laguerre polynomial sequence , and , where the constant polynomial is omitted. We derive two representations for the polynomials in terms of moments by using determinants. The first representation in terms of the canonical moments is rather cumbersome. We introduce adjusted moments and find a second, more elegant formula. We deduce a recursion formula for the moments and the adjusted ones. The adjusted moments are also expressed via a generating function. We observe a certain detachedness of the first two moments from the others.     

Asymptotics of polynomials orthogonal with respect to varying measures

Letd be a finite positive Borel measure on the interval [0, 2] such that >0 almost everywhere; andW _n be a sequence of polynomials, degW _n =n, whose zeros (w _n ,1,,w _n,n lie in [|z|1]. Let d _n <> for each_nN, whered _n =d/|W _n (e ⁱ )|². We consider the table of polynomials _n,m such that for each fixednN the system _n,m,mN, is orthonormal with respect tod _n . If

Expansions of one density via polynomials orthogonal with respect to the other

We expand the Chebyshev polynomials and some of its linear combination in linear combinations of the q-Hermite, the Rogers (q-utraspherical) and the Al-Salam-Chihara polynomials and vice versa. We use these expansions to obtain expansions of some densities, including q-Normal and some related to it, in infinite series constructed of the products of the other density times polynomials orthogonal to it, allowing deeper analysis and discovering new properties. On the way we find an easy proof of expansion of the Poisson-Mehler kernel as well as its reciprocal. We also formulate simple rule relating one set of orthogonal polynomials to the other given the properties of the ratio of the respective densities of measures orthogonalizing these polynomials sets.     

Representations for the first associated q-classical orthogonal polynomials

Let {p_k(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation D_q(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {p_k⁽¹⁾(x;q)} be associated polynomials of the polynomials {p_k(x; q)}. Explicit forms of the coefficients b_n,k and c_n,k in the expansions

are given in terms of basic hypergeometric functions. Here _k(x) equals x^k if σ⁺(0)=0, or (x;q)_k if σ⁺(1)=0, where σ⁺(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by p_n−1⁽¹⁾(x;q) in a special form, recurrence relations (in k) for b_n,k and c_n,k are obtained in terms of σ and τ.     

On Fejér's inequalities for the Legendre polynomials

We present various inequalities for the sum where denotes the Legendre polynomial of degree k . Among others we prove that the inequalities hold for all and . The constant factors 2/5 and are sharp. This refines a classical result of Fejér, who proved in 1908 that is nonnegative for all and .     

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.     

On the limit behavior of recurrence coefficients for multiple orthogonal polynomials

In this paper we investigate general properties of the coefficients in the recurrence relation satisfied by multiple orthogonal polynomials. The results include as particular cases Angelesco and Nikishin systems.