We present a simple approach in order to compute recursively the connection coefficients between two families of classical (discrete) orthogonal polynomials (Charlier, Meixner, Kravchuk, Hahn), i.e., the coefficients C,.(n) in the expression P.(x) = ~"m=O C,n(n)Q.,(x), where {P.(x)) and {Q,.(x)} bel
Connection relations and bilinear formulas for the classical orthogonal polynomials
β Scribed by Mourad E.H Ismail
- Book ID
- 107800508
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 438 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Limit relations between classical continuous (Jacobi, Laguerre, Hermite) and discrete (Charlier, Meixner, Kravchuk, Hahn) orthogonal polynomials are well known and can be described by relations of type lim;~ P~(x; 2) = Qn(X). Deeper information on these limiting processes can be obtained from the ex
We give explicitly recurrence relations satisfied by the connection coefficients between two families of the classical orthogonal polynomials of a discrete variable (i.e., associated with the names of Charlier, Meixner, Krawtchouk and Hahn). Also, a recurrence relation is given for the coefficients
We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show that these extremal points for the intervals [-1, 1], [0, β) and (-β, β), which are analogues of Menke points for a closed curve, ar