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

Given two families of polynomials the so-called connection problem consists of computation of the coefficients of the decomposition of polynomials from one family upon the polynomials of the other family. The authors present a simple approach for recursive computation of the connection coefficients of classical orthogonal polynomials (Hermite, Laguerre, Jacobi and Bessel). The general and systematic algorithm developed by the authors recently is applied to these polynomials and extensions of the proposed method for two related connection problems and for the generalized linearization problem are also given.