Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case

[摘要] We present a simple approach in order to compute recursively the connection coefficients between two families of classical (continuous) orthogonal polynomials (Hermite, Laguerre, Jacobi and Bessel), i.e. the coefficients Cm(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 classical situation. Moreover, extensions of this method to some related connection problems and to the generalized linearization problem are given.

[发布日期] 1997-10-28

[关键词] orthogonal polynomials;connection problem;linearization problem