×

A distributional study of discrete classical orthogonal polynomials. (English) Zbl 0853.33009

This paper is a systematic study of discrete classical orthogonal polynomial sequences (Charlier, Meixner, Hahn) from a distributional viewpoint. The properties for the continuous case orthogonal polynomial sequences (denoted here by DOPS; Hermite, Laguerre, Jacobi, Bessel) can a.o. be derived from a distributional differential equation \(D (\varphi u) = \psi u\) for the associated linear functional \(u\) (cf. F. Marcellán, A. Branquinho and J. Petronilho [Acta Appl. Math. 34, 283-303 (1994; Zbl 0793.33009)]). The authors replace the differential operator \(D\) and the word ‘differential’ by the difference operator \(\Delta\) and the word ‘difference’ and derive properties analogous to those in the continuous case (Sturm-Liouville differential equation of order 2, \(D(P_n)\) again is a DOPS, Rodrigues formula, structure relation, Pearson differential equation for the associated weight). As stated in the opening sentence of this review the work is done systematically: in a (large) number of small steps (4 definitions, 10 lemmas, 9 propositions, 1 theorem and several remarks) the results are derived. A well written paper, suitable for inclusion in a (graduate) textbook on orthogonal polynomials.

MSC:

33C45 Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)

Citations:

Zbl 0793.33009
Full Text: DOI

References:

[1] Al-Salam, W. A., Characterization theorems for orthogonal polynomials, (Nevai, P., Orthogonal Polynomials: Theory and Practice (1990), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht), 1-24 · Zbl 0133.32305
[2] Chihara, T. S., An Introduction to Orthogonal Polynomials (1978), Gordon and Breach: Gordon and Breach New York · Zbl 0389.33008
[3] Hahn, V. W., Über Orthogonalpolynome die \(q\)-Differenzengleichungen genügen, Math. Nachr., 2, 4-34 (1949) · Zbl 0031.39001
[4] Hildebrandt, E. H., Systems of polynomials connected with the Charlier expansions and the Pearson differential and difference equations, Ann. Math. Statist., 2, 379-439 (1931) · Zbl 0004.34402
[5] Labelle, J., Tableau d’Askey, (Brezinski, C.; etal., Polynômes Orthogonaux et Applications. Polynômes Orthogonaux et Applications, Lecture Notes in Math., 1171 (1985), Springer: Springer Berlin), xxxvi, xxxvii
[6] Lancaster, O. E., Orthogonal polynomials defined by difference equations, Amer. J. Math., 63, 185-207 (1941) · Zbl 0024.15204
[7] Lesky, P., Die Vervollständigung der diskreten klassischen Orthogonalpolynome, Anz. Öst. Akad. Wiss. Math. Nat. Klasse, 198, 295-315 (1989) · Zbl 0801.33011
[8] Lesky, P., Orthogonal polynomials and eigenvalue problems (1991), Preprint, Stuttgart
[9] Branquinho, A.; Marcellán, F.; Petronilho, J., Classical orthogonal polynomials: a functional approach, Acta Appl. Math., 34, 283-303 (1994) · Zbl 0793.33009
[10] Maroni, P., Une théorie algébrique des polynômes orthogonaux. Application aux polynômes orthogonaux semi-classiques, (Brezinski, C.; etal., Orthogonal Polynomials and their Applications. Orthogonal Polynomials and their Applications, IMACS Ann. Comput. Appl. Math., 9 (1991), Baltzer: Baltzer Basel), 95-130 · Zbl 0944.33500
[11] Nikiforov, A. F.; Suslov, S. K.; Uvarov, V. B., Classical Orthogonal Polynomials of a Discrete Variable (1991), Springer: Springer Berlin · Zbl 0743.33001
[12] Nikiforov, A. F.; Uvarov, V. B., Special Functions of Mathematical Physics (1988), Birkhäuser: Birkhäuser Basel · Zbl 0694.33005
[13] Smaili, N.-E., Les polynômes \(E\)-semi-classiques de classe zéro, (Thèse 3ème cycle (1987), Université Pierre et Marie Curie: Université Pierre et Marie Curie Paris)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.