Corrigendum: Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
This is a corrected version of the original article [\textit{I. Area}, \textit{E. Godoy}, \textit{A. Ronveaux} and \textit{A. Zarzo}, J. Comput. Appl. Math. 87, No. 2, 321-337 (1997; Zbl 0892.65078)]. The differences between the two versions are minimal. On the main differences is the reference to the important article [\textit{G. Gasper}, J. Math. Anal. Appl. 45, 176-198 (1974; Zbl 0276.33026)]. The authors use their algorithmic methods developed in a.o. [\textit{E. Godoy, A. Ronveaux, A. Zarzo} and \textit{I. Area}, J. Comput. Appl. Math. 84, No. 2, 257-275 (1997; Zbl 0909.65008)], [\textit{A. Ronveaux}, \textit{A. Zarzo} and \textit{E. Godoy}, J. Comput. Appl. Math. 62, No. 1, 67-73 (1995; Zbl 0876.65005)] and [\textit{A. Zarzo}, \textit{I. Area}, \textit{E. Godoy} and \textit{A. Ronveaux}, J. Phys. A: Math. Gen. 30, L35--L40 (1997)] to find minimal recurrence relations for the connection coefficients between two families of discrete orthogonal polynomials. They give explicit results in the case of the Charlier, Meixner and Krawtchouk polynomials. The case of Hahn polynomials can be dealt with in a similar way as the authors remark. Note by the reviewer: the title of the last reference (in this review and in the article) is cited wrong by the authors.
scientific article; zbMATH DE number 1186863