Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case (vol 87, pg 321, 1996)

[摘要] We present a simple approach in order to compute recursively the connection coefficients between two families of classical (discrete) orthogonal polynomials (Charlier, Meixner, Kravchuk, Hahn), i.e., the coefficients C-m(n) in the expression P-n(x) = Sigma(m=0)(n)C(m)(n)Q(m)(x), where (P-n(x)) and (Q(m)(x)) belong to the aforementioned class of polynomials. This is done by adapting a general and systematic algorithm, recently developed by the authors, to the discrete classical situation. Moreover, extensions of this method allow to give new addition formulae and to estimate C-m(n)-asymptotics in limit relations between some families. (C) 1998 Elsevier Science B.V. All rights reserved.

[发布日期] 1998-03-16

[关键词] orthogonal polynomials of a discrete variable;connection problems