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
โฆ LIBER โฆ
Recurrence relations for connection coefficients between two families of orthogonal polynomials
โ Scribed by A. Ronveaux; A. Zarzo; E. Godoy
- Book ID
- 107989061
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 335 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Minimal recurrence relations for connect
โ
I. Area; E. Godoy; A. Ronveaux; A. Zarzo
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 712 KB
Minimal recurrence relations for connect
โ
I. Area; E. Godoy; A. Ronveaux; A. Zarzo
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 693 KB
Recurrence relations for the connection
โ
Stanislaw Lewanowicz
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 575 KB
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
Orthogonality measures for orthogonal ma
โ
R. R. Vasyukov
๐
Article
๐
2009
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 514 KB
Recurrence relations for the connection
โ
Stanislaw Lewanowicz
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 436 KB
Recurrence relations with rational coeff
โ
A. I. Bogolyubskii
๐
Article
๐
2011
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 159 KB