On the limit relations between classical continuous and discrete orthogonal polynomials (Q1298529)

The limit relations between families of classical continuous and discrete orthogonal polynomials appearing at the lower levels of the Askey scheme of hypergeometric orthogonal polynomials can be written in the form \[ \lim\limits_{\lambda\rightarrow\infty}P_n(x;\lambda)=Q_n(x). \] Here \(\lambda\) is a limiting parameter. It turns out that in those situations the polynomial \(P_n(x;\lambda)\) is always a rational function of \(\lambda\) such that there exists an expansion in the form \[ P_n(x;\lambda)=\sum_{k=0}^{\infty}\frac{R_k(x;n)}{\lambda^k}. \] By using the connection coefficients \(C_m(n;\lambda)\) in the expansion \[ P_n(x;\lambda)=\sum_{m=0}^nC_m(n;\lambda)Q_m(x) \] the authors derive the coefficients \(S_k(n;m)\) in \[ C_m(n;\lambda)=\sum_{k=0}^{\infty}\frac{S_k(n;m)}{\lambda^k}. \] This eventually leads to \[ R_k(x;n)=\sum_{m=0}^nS_k(n;m)Q_m(x). \] The connection coefficients \(C_m(n;\lambda)\) are obtained by using an algorithm involving recurrence relations developed by the authors. See \textit{E. Godoy, A. Ronveaux, A. Zarzo} and \textit{I. Area}, ibid. 84, No. 2, 257-275 (1997; Zbl 0909.65008) and \textit{I. Area, E. Godoy, A. Ronveaux} and \textit{A. Zarzo}, ibid. 89, No. 2,309-325 (1998; Zbl 0934.33014) for the application of their algorithm to the classical continuous and discrete orthogonal polynomials.