On Connection, Linearization and Duplication Coefficients of Classical Orthogonal Polynomials

In this work, we have mainly achieved the following: 1. we provide a review of the main methods used for the computation of the connection and linearization coefficients between orthogonal polynomials of a continuous variable, moreover using a new approach, the duplication problem of these polynomial families is solved; 2. we review the main methods used for the computation of the connection and linearization coefficients of orthogonal polynomials of a discrete variable, we solve the duplication and linearization problem of all orthogonal polynomials of a discrete variable; 3. we propose a method to generate the connection, linearization and duplication coefficients for q-orthogonal polynomials; 4. we propose a unified method to obtain these coefficients in a generic way for orthogonal polynomials on quadratic and q-quadratic lattices. Our algorithmic approach to compute linearization, connection and duplication coefficients is based on the one used by Koepf and Schmersau and on the NaViMa algorithm. Our main technique is to use explicit formulas for structural identities of classical orthogonal polynomial systems. We find our results by an application of computer algebra. The major algorithmic tools for our development are Zeilberger’s algorithm, q-Zeilberger’s algorithm, the Petkovšek-van-Hoeij algorithm, the q-Petkovšek-van-Hoeij algorithm, and Algorithm 2.2, p. 20 of Koepf's book "Hypergeometric Summation" and it q-analogue.

Interlacing of zeros of orthogonal polynomials under modification of the measure

We investigate the mutual location of the zeros of two families of orthogonal polynomials. One of the families is orthogonal with respect to the measure dμ (x), supported on the interval (a, b) and the other with respect to the measure |x -c|τ|x -d|γdμ (x), where c and d are outside (a, b) We prove that the zeros of these polynomials, if they are of equal or consecutive degrees, interlace when either 0 < τ, γ ≤ 1 or γ = 0 and 0 < τ ≤ 2. This result is inspired by an open question of Richard Askey and it generalizes recent results on some families of orthogonal polynomials. Moreover, we obtain further statements on interlacing of zeros of specific orthogonal polynomials, such as the Askey-Wilson ones. © 2013 Elsevier Inc.

Orthogonal polynomials and recurrence equations, operator equations and factorization

This article surveys the classical orthogonal polynomial systems of the Hahn class, which are solutions of second-order differential, difference or q-difference equations. Orthogonal families satisfy three-term recurrence equations. Example applications of an algorithm to determine whether a three-term recurrence equation has solutions in the Hahn class - implemented in the computer algebra system Maple - are given. Modifications of these families, in particular associated orthogonal systems, satisfy fourth-order operator equations. A factorization of these equations leads to a solution basis.

Characterization theorem for classical orthogonal polynomials on non-uniform lattices: The functional approach

Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the Riccati equation for the formal Stieltjes function.

Monotonicity and asymptotics of zeros of Sobolev type orthogonal polynomials: A general case

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Connection coefficients and zeros of orthogonal polynomials

We discuss an old theorem of Obrechkoff and some of its applications. Some curious historical facts around this theorem are presented. We make an attempt to look at some known results on connection coefficients, zeros and Wronskians of orthogonal polynomials from the perspective of Obrechkoff's theorem. Necessary conditions for the positivity of the connection coefficients of two families of orthogonal polynomials are provided. Inequalities between the kth zero of an orthogonal polynomial p(n)(x) and the largest (smallest) zero of another orthogonal polynomial q(n)(x) are given in terms of the signs of the connection coefficients of the families {p(n)(x)} and {q(n)(x)}, An inequality between the largest zeros of the Jacobi polynomials P-n((a,b)) (x) and P-n((alpha,beta)) (x) is also established. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Monotonicity of zeros of Laguerre-Sobolev-type orthogonal polynomials

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Monotonicity of zeros of Jacobi-Sobolev type orthogonal polynomials

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

L-orthogonal polynomials associated with related measures

A positive measure psi defined on [a, b] such that its moments mu(n) = integral(b)(a)t(n) d psi(t) exist for n = 0, +/-1, +/-2. can be called a strong positive measure on [a, b] When 0 <= a < b <= infinity the sequence of polynomials {Q(n)} defined by integral(b)(a) t(-n+s) Q(n)(t) d psi(t) = 0, s = 0, ., n - 1, exist and they are referred here as L-orthogonal polynomials We look at the connection between two sequences of L-orthogonal polynomials {Q(n)((1))} and {Q(n)((0))} associated with two closely related strong positive measures and th defined on [a, b]. To be precise, the measures are related to each other by (t - kappa) d psi(1)(t) = gamma d psi(0)(t). where (t - kappa)/gamma is positive when t is an element of (n, 6). As applications of our study. numerical generation of new L-orthogonal polynomials and monotonicity properties of the zeros of a certain class of L-orthogonal polynomials are looked at. (C) 2010 IMACS Published by Elsevier B V All rights reserved

A Characterization of L-orthogonal Polynomials from Three Term Recurrence Relations

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Recurrence relations for Clifford algebra-valued orthogonal polynomials

The theory of orthogonal polynomials of one real or complex variable is well established as well as its generalization for the multidimensional case. Hypercomplex function theory (or Clifford analysis) provides an alternative approach to deal with higher dimensions. In this context, we study systems of orthogonal polynomials of a hypercomplex variable with values in a Clifford algebra and prove some of their properties.

Asymptotics of orthogonal polynomials via the Koosis theorem

The main aim of this short paper is to advertize the Koosis theorem in the mathematical community, especially among those who study orthogonal polynomials. We (try to) do this by proving a new theorem about asymptotics of orthogonal polynomi- als for which the Koosis theorem seems to be the most natural tool. Namely, we consider the case when a SzegÄo measure on the unit circumference is perturbed by an arbitrary measure inside the unit disk and an arbitrary Blaschke sequence of point masses outside the unit disk.

Sobolev orthogonal polynomials on a simplex

Vegeu el resum a l'inici del document de l'arxiu adjunt

A generic polynomial solution for the differential equation of hypergeometric type and six sequences of orthogonal polynomials related to it

In this work, we present a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type s(x)y"n(x) + t(x)y'n(x) - lnyn(x) = 0 and show that all the three classical orthogonal polynomial families as well as three finite orthogonal polynomial families, extracted from this equation, can be identified as special cases of this derived polynomial sequence. Some general properties of this sequence are also given.

A generic formula for the values at the boundary points of monic classical orthogonal polynomials

In a previous paper we have determined a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type σ(x)y"n(x)+τ(x)y'n(x)-λnyn(x)=0. In this paper, we give another such formula which enables us to present a generic formula for the values of monic classical orthogonal polynomials at their boundary points of definition.