×

The symmetric \(D_{\omega}\)-semi-classical orthogonal polynomials of class one. (English) Zbl 1181.42028

The present paper is devoted to the study of the semi-classical orthogonal polynomials of class one associated with the \(D_w\) Laguerre-Hahn form of class one, being \(D_w\) the difference operator \((D_{\omega}p)(x)= (p(x+\omega) - p(x))/\omega\). When \(w\to0\) it becomes into the derivative operator [and the corresponding problem was solved by J. Alaya and P. Maroni, Integral Transforms Spec. Funct. 4, No. 4, 301–320 (1996; Zbl 0865.42021)]. For this case (\(D_w\) case), the authors deduce the set of Laguerre-Freud equations corresponding to the \(D_w\) semi-classical orthogonal polynomials of class one and completely solve it in the symmetric case obtaining two canonical forms. This two forms are studied in details and the corresponding integral representations as well as the the parameters of the corresponding three-term recurrence of the associated family of orthogonal polynomials relation are explicitly given. By taking the limit \(\omega\to0\) they recovered their previous results (published in the aforementioned paper).

MSC:

42C05 Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis

Citations:

Zbl 0865.42021
Full Text: DOI

References:

[1] Abdelkarim, F., Maroni, P.: The D {\(\omega\)} -classical orthogonal polynomials. Result. Math. 32, 1–28 (1997) · Zbl 0889.42020
[2] Alaya, J., Maroni, P.: Symmetric Laguerre–Hahn forms of class s=1. Integral Transforms Spec. Funct. 4, 301–320 (1996) · Zbl 0865.42021 · doi:10.1080/10652469608819117
[3] Askey, R., Wilson, J.: A set of hypergeometric orthogonal polynomials. SIAM J. Math. Anal. 13, 651–655 (1982) · Zbl 0496.33007 · doi:10.1137/0513043
[4] Askey, R., Wilson, J.: Some Basic Hypergeomertic Orthogonal Polynomials that Generalize Jacobi Polynomials. Memoirs of the American Mathematical Society 319. Providence, Rhole Island (1985) · Zbl 0572.33012
[5] Chihara, T.S.: An Introduction to Orthogonal Polynomials. Gordon and Breach, New York (1978) · Zbl 0389.33008
[6] Bachène, M.: Les polynômes semi-classiques de classe zéro et de classe un. Thesis of third cycle, Univ. P. and M. Curie, Paris (1985)
[7] Belmehdi, S.: On semi-classical linear functional of class s=1. Classification and integral representations. Indag. Math. 3, 253–275 (1992) · Zbl 0783.33003
[8] Foupouagnigni, M., Hounkonnou, M.N., Ronveaux, A.: Laguerre–Freud equations for the recurrence coefficients of D {\(\omega\)} -semi-classical orthogonal polynomials of class one. J. Comp. Appl. Math. 99, 143–154 (1998) · Zbl 0931.33009 · doi:10.1016/S0377-0427(98)00152-6
[9] Koekoek, R., Swarttow, R.F.: The ASkey-scheme of hypergeometric orthogonal polynomials and its q-analogue. Report 98–17, TU Delft (1998)
[10] Marcellan, F., Salto, L.: Discrete semi-classical orthogonal polynomials. J. Differ. Equ. Appl. 4, 463–490 (1998) · Zbl 0916.33006 · doi:10.1080/10236199808808156
[11] Maroni, P.: Variations around classical orthogonal polynomials. Connected problems. J. Comp. Appl. Math. 48, 133–155 (1993) · Zbl 0790.33006 · doi:10.1016/0377-0427(93)90319-7
[12] Ronveaux, A.: Discrete semi-classical orthogonal polynomials: generalized Meixner polynomials. J. Approx. Theory 46(4), 403–407 (1986) · Zbl 0591.42015 · doi:10.1016/0021-9045(86)90073-0
[13] Stieltjes, T.J.: Recherche sur les fractions continues. Ann. Fac. Sci. Toulouse 8, J1–122 (1894); 9, A 1–47 (1895)
[14] Van Assche, W., Foupouagnigni, M.: Analysis of non-linear recurrence relations for the recurrence coefficients of generalized Charlier polynomials. J. Nonlin. Math. Phys. 10 (Suppl. 2), 231–237 (2003) · Zbl 1362.39018 · doi:10.2991/jnmp.2003.10.s2.19
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.