A matrix approach for the semiclassical and coherent orthogonal polynomials

https://doi.org/10.1016/j.amc.2015.01.071Get rights and content

Abstract

We obtain a matrix characterization of semiclassical orthogonal polynomials in terms of the Jacobi matrix associated with the multiplication operator in the basis of orthogonal polynomials, and the lower triangular matrix that represents the orthogonal polynomials in terms of the monomial basis of polynomials. We also provide a matrix characterization for coherent pairs of linear functionals.

Introduction

Let us consider a linear functional U:PC defined on the linear space P of polynomials with complex coefficients. A sequence of monic polynomials Pn(x)n0 such thatdeg(Pn(x))=nandU,Pn(x)Pm(x)=knδn,mwithkn0,n,m0,is said to be the sequence of monic orthogonal polynomials (SMOP) associated with U. The existence of a SMOP can be characterized in terms of the infinite Hankel matrix H=[ui+j]i,i0, where un=U,xn,n0, are called the moments associated with U. Indeed, Pn(x)n0 exists if and only if the leading principal submatricesHn=[ui+j]i,j=0n,n0,of H are nonsingular. In this situation, U is said to be a quasi-definite or regular [3]. On the other hand, if for every n0,detHn>0,U is said to be positive definite and it has the integral representationU,q(x)=Eq(x)dμ(x),where μ is a nontrivial positive Borel measure supported on some infinite subset ER. Assuming u0=1, the most familiar sequences of orthogonal polynomials are the so-called classical families: Jacobi, Laguerre and Hermite polynomials. They correspond to the cases when E has bounded support (E=[-1,1]), E is the positive real axis, and E=R, respectively, and the corresponding probability measures are the Beta, Gamma and normal distributions. There are several ways to characterize the classical orthogonal polynomials: as polynomial solutions of a hypergeometric differential equation, as polynomials expressed by a Rodrigues formula, and as the only sequences of orthogonal polynomials whose derivatives also constitute an orthogonal family.

One of the most important properties of orthogonal polynomials is that they satisfy the three term recurrence relationxPn(x)=Pn+1(x)+bnPn(x)+anPn-1(x),n0,where P-1(x)0,bnR,n0, and an0,n1. If U is positive definite, we have an>0,n1. In a matrix form,xP(x)=JP(x),where P(x)=[P0(x),P1(x),]T and J is the tridiagonal infinite matrixJ=b010a1b110a2b2,called the monic Jacobi matrix associated with Pn(x)n0. It is straightforward to see that the zeros of Pn are the eigenvalues of Jn, the n×n principal leading submatrix of J. On the other hand, given arbitrary sequences {bn}n0 and {an}n1, with bnR and an0, you can define J as in (2) and construct {Pn(x)}n0 by using (1). Then, {Pn(x)}n0 is orthogonal with respect to some linear functional U. This relevant fact is known in the literature as Favard’s theorem (see [3]).

Recently, in [20], a matrix characterization for classical orthogonal polynomials was introduced. Let writePn(x)=j=0nan,jxj,n0,and let define the infinite matrix A with entries an,j, for 0jn,n0, and zero otherwise. Notice that A is a lower triangular matrix whose nth row contains the coefficients of the nth degree orthogonal polynomial with respect to the canonical basis {xn}n0. Furthermore, since Pn is monic, the diagonal entries are an,n=1 and, therefore, A is nonsingular. We say that A is the matrix associated with the sequence {Pn(x)}n0. If the polynomials are classical, we will say that A is classical.

Following the notation used in [20], we say that a matrix B is a lower semi-matrix if there exists an integer m such that bi,j=0 whenever i-j<m. The entry bi,j is in the mth diagonal i-j=m. If B is non zero, we say that B has index m, ind(B)=m, if m is the minimum integer such that B has at least one nonzero entry in the mth diagonal, also if all the entries in its diagonal of index m are equal to 1,B is called monic. Finally, B is said to be (n,m)-banded if there exists a pair of integers (n,m) with nm and all the nonzero entries of B lie between the diagonals of indices n and m. It is easy to see that the set of banded matrices is closed under addition and multiplication, despite the fact that the inverse of a banded matrix might not be banded.

Let define the matricesD=0000100002000030,Dˆ=0100001/200001/30000,X=0100001000010000,then we get the following matrix characterization for the orthogonality of a sequence of polynomials.

Theorem 1

Let {Pn(x)}n0 be a monic polynomial sequence and let A be its associated matrix. Then, the sequence {Pn(x)}n0 is orthogonal with respect to some linear functional if and only if J=AXA-1 is a (-1,1)-banded matrix whose entries in the diagonals of indices 1 and1 are all nonzero.

The proof can be found in [20]. Notice that this is a matrix version of the Favard’s theorem, and the entries of J, i.e., the coefficients of the recurrence relation for the orthogonal polynomials, can be obtained from the matrix A. On the other hand, AD has index 1 and its kth row is the vector [ak,1,2ak,2,3ak,3,,kak,k,0,], which corresponds to the derivative of Pk(x). Therefore the matrix Ã=DˆAD is a monic matrix of index zero and it is associated with the sequence {Pn[1](x)}n0, where Pn[1](x)=Pn+1(x)/(n+1). Using the fact that a sequence of orthogonal polynomials is classical if and only if the sequence of their derivatives is also orthogonal, the following matrix characterization for classical polynomials is also given in [20].

Theorem 2

Let A be the matrix associated with {Pn(x)}n0. Then A is classical if and only if AÃ-1 is a (0, 2)-banded monic matrix.

Section snippets

A matrix characterization for semiclassical polynomials

Let ϕ(x)=atxt++a0,ψ(x)=blxl++b0 be non zero polynomials such that atbl0,t0,l1. (ϕ,ψ) is called an admissible pair if either t-1l or, t-1=l and nal+1+bl0,n0. A quasi-definite linear functional U is said to be semiclassical if there exists an admissible pair (ϕ,ψ) such that U satisfiesD(ϕU)=ψU,where D denotes the distributional derivative. The corresponding sequence of orthogonal polynomials is called semiclassical.

The class of a semiclassical linear functional is the non negative integers

A matrix characterization for the coherence of orthogonal polynomials

We say that two non-trivial probability measures, dμ0 and dμ1, constitute a (k,0)-coherent pair of order m, with k,mN0 fixed constants, if for each nN, the monic orthogonal polynomial Pn(·;dμ1) can be expressed as a linear combination of the set Pn+m(m)(·;dμ0),,Pn+m-k(m)(·,dμ0). The coherence is classified in terms of k and m. The concept of coherence was introduced by Iserles et al. in [9] and deeply analyzed in [10]. They established that a pair of regular linear functionals (U,V) in the

Acknowledgements

The work of the first author was supported by a grant of the Secretaría de Educación Pública of México and the Mexican Government. The work of the second author was supported by Consejo Nacional de Ciencia y Tecnología of México, Grant 156668. The work of the third author was supported by Dirección General de Investigación Científica y Técnica, Ministerio de Economía y Competitividad of Spain, Grant MTM2012–36732-C03–01.

References (20)

There are more references available in the full text version of this article.

Cited by (10)

View all citing articles on Scopus
View full text