Perturbed Recurrence Relations

In this paper, we give some new relations between two families of polynomials defined by three-term recurrence relations. These relations allow us to study how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation are perturbed. In the literature some methods are already available. However, most of them are only effective for small perturbations. In order to show the sharpness of our method, we compare it with Gronwall's classical method in the case of large perturbations. Using our tool, we also give a relation between the differential equation satisfied by a family of orthogonal polynomials and its perturbed family. Some explicit results are obtained for Chebyshev polynomials of the second kind.     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

On sequences of Hurwitz polynomials related to orthogonal polynomials

ABSTRACT

In this contribution, we explore the well-known connection between Hurwitz and orthogonal polynomials. Namely, given a Hurwitz polynomial, it is shown that it can be decomposed into two parts: a polynomial that is orthogonal with respect to some positive measure supported in the positive real axis and its corresponding second-kind polynomial. Conversely, given a sequence of orthogonal polynomials with respect to a positive measure supported in the positive real axis, a sequence of Hurwitz polynomials can be constructed. Based on that connection, we construct sequences of Hurwitz polynomials that satisfy a recurrence relation, in a similar way as the orthogonal polynomials do. Even more, we present a way to construct families of Hurwitz polynomials using two sequences of parameters and a recurrence relation that constitutes an analogue of Favard's theorem in the theory of orthogonal polynomials.     

The relation of the d-orthogonal polynomials to the Appell polynomials

We are dealing with the concept of d-dimensional orthogonal (abbreviated d-orthogonal) polynomials, that is to say polynomials verifying one standard recurrence relation of order d + 1. Among the d-orthogonal polynomials one singles out the natural generalizations of certain classical orthogonal polynomials. In particular, we are concerned, in the present paper, with the solution of the following problem (P): Find all polynomial sequences which are at the same time Appell polynomials and d-orthogonal. The resulting polynomials are a natural extension of the Hermite polynomials.

A sequence of these polynomials is obtained. All the elements of its (d + 1)-order recurrence are explicitly determined. A generating function, a (d + 1)-order differential equation satisfied by each polynomial and a characterization of this sequence through a vectorial functional equation are also given. Among such polynomials one singles out the d-symmetrical ones (Definition 1.7) which are the d-orthogonal polynomials analogous to the Hermite classical ones. When d = 1 (ordinary orthogonality), we meet again the classical orthogonal polynomials of Hermite.     

Connection coefficients between orthogonal polynomials and the canonical sequence: an approach based on symbolic computation

We deal with the problem of obtaining closed formulas for the connection coefficients between orthogonal polynomials and the canonical sequence. We use a recurrence relation fulfilled by these coefficients and symbolic computation with the Mathematica language. We treat the cases of Gegenbauer, Jacobi and a new semi-classical sequence.     

Rakhmanov's theorem for orthogonal matrix polynomials on the unit circle

Rakhmanov's theorem for orthogonal polynomials on the unit circle gives a sufficient condition on the orthogonality measure for orthogonal polynomials on the unit circle, in order that the reflection coefficients (the recurrence coefficients in the Szegő recurrence relation) converge to zero. In this paper we give the analog for orthogonal matrix polynomials on the unit circle.     

Matrix Chebyshev polynomials and continued fractions

In the first part we expose the notion of continued fractions in the matrix case. In this paper we are interested in their connection with matrix orthogonal polynomials.

In the second part matrix continued fractions are used to develop the notion of matrix Chebyshev polynomials. In the case of hermitian coefficients in the recurrence formula, we give the explicit formula for the Stieltjes transform, the support of the orthogonality measure and its density. As a corollary we get the extension of the matrix version of the Blumenthal theorem proved in [J. Approx. Theory 84 (1) (1996) 96].

The third part contains examples of matrix orthogonal polynomials.     

Bootstrapping and Askey–Wilson polynomials

The mixed moments for the Askey–Wilson polynomials are found using a bootstrapping method and connection coefficients. A similar bootstrapping idea on generating functions gives a new Askey–Wilson generating function. Modified generating functions of orthogonal polynomials are shown to generate polynomials satisfying recurrences of known degree greater than three. An important special case of this hierarchy is a polynomial which satisfies a four term recurrence, and its combinatorics is studied.     

The Painlevé Equations and Orthogonal Polynomials

This article is a survey of the recent studies jointly with Lies Boelen, Christophe Smet, Walter Van Assche and Lun Zhang (KULeuven, Belgium) on semi-classical continuous and discrete orthogonal polynomials and, in particular, on the connection of their recurrence coefficients to the solutions of the Painlevé equations. After recalling some basic facts about the Painlevé equations, we discuss continuous and discrete orthogonal polynomials and explain their connection.     

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.     

Second order partial differential equations for gradients of orthogonal polynomials in two variables

In this work, we introduce the classical orthogonal polynomials in two variables as the solutions of a matrix second order partial differential equation involving matrix polynomial coefficients, the usual gradient operator, and the divergence operator. Here we show that the successive gradients of these polynomials also satisfy a matrix second order partial differential equation closely related to the first one.     

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 between Boas-Buck polynomial sets

In this paper, a general method to express explicitly connection coefficients between two Boas-Buck polynomial sets is presented. As application, we consider some generalized hypergeometric polynomials, from which we derive some well-known results including duplication and inversion formulas.     

Matrix-valued polynomials generated by the scalar-type Rodrigues’ formulas

The properties of matrix-valued polynomials generated by the scalar-type Rodrigues’ formulas are analyzed. A general representation of these polynomials is found in terms of products of simple differential operators. The recurrence relations, leading coefficients, completeness are established, as well as, in the commutative case, the second order equations for which these polynomials are eigenfunctions and the corresponding eigenvalues, and ladder operators.A new, direct proof is given to the conjecture of Durán and Grünbaum that if the weights are self-adjoint and positive semidefinite then they are necessarily of scalar type.Commutative classes of orthogonal polynomials (corresponding to weights that are self-adjoint but not positive semidefinite) are found, which satisfy all the properties usually associated to orthogonal polynomials, and are not of scalar type.     

有关调和数的更多渐近展开公式

基于指数型完全Bell多项式,建立了一个一般调和数渐近展开式,并给出展开式中系数的相应递推关系.由生成函数方法进一步推导出这些系数的具体表达式.另外,我们建立了两个在对数项里只含有奇数或偶数次幂项的lacunary调和数渐近展开式,     

A vector Chebyshev algorithm

We consider polynomials orthogonal relative to a sequence of vectors and derive their recurrence relations within the framework of Clifford algebras. We state sufficient conditions for the existence of a system of such polynomials. The coefficients in the above relations may be computed using a cross-rule which is linked to a vector version of the quotient-difference algorithm, both of which are proved here using designants. An alternative route is to employ a vector variant of the Chebyshev algorithm. This algorithm is established and an implementation presented which does not require general Clifford elements. Finally, we comment on the connection with vector Padé approximants. This revised version was published online in June 2006 with corrections to the Cover Date.     

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 characterization of the Chebyshev and Fibonacci polynomials

We consider sequences of polynomials of hypergeometric type satisfying a three-term recurrence relation with constant coefficients and general initial conditions. We characterize among these the Chebyshev and Fibonacci polynomials. Furthermore, we show some necessary conditions and links between the coefficients of the recurrence relation and initial conditions, and the coefficients of the hypergeometric type differential equation in order that this is satisfied by a sequence of polynomials.     

Recurrence Formula for Polynomials of Two Variables, Orthogonal with Respect to Rotation Invariant Measures

We give the recurrence formula satisfied by polynomials of two variables, orthogonal with respect to a rotation invariant measure. Moreover, we show that for polynomials satisfying such a recurrence formula, there exists an orthogonality measure which is rotation invariant. We also compute explicitly the recurrence coefficients for the disk polynomials. January 4, 1997. Date revised: October 15, 1997. Date accepted: October 21, 1997.     

Perturbed recurrence relations III the general case—some new applications

In this paper, we give some new extensions and some new applications of our results on the perturbation of coefficients and the order of a general recurrence relation—for example we will give some new results for the asymptotic properties, for the zeros and for the differential equations of the polynomials which satisfy the perturbed recurrence relation.