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
On the limit relations between classical continuous and discrete orthogonal polynomials
β Scribed by E. Godoy; A. Ronveaux; A. Zarzo; I. Area
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 434 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
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 expansion P,(x; 2)= oo ~-]k=0 Rk(x; n)/2 . In this paper a method for the recursive computation of coefficients Rk(x; n) is designed being the main tool the consideration of a closely related connection problem which can be solved, also recurrently, by using an algorithm recently developed by the authors.
π SIMILAR VOLUMES
A b s t r a c t . Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reds is examined based on cert
## Abstract The discrete Lotka power function describes the number of sources (e.g., authors) with __n__ = 1, 2, 3, β¦ items (e.g., publications). As in econometrics, informetrics theory requires functions of a continuous variable __j__, replacing the discrete variable __n__. Now __j__ represents it