๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Connection coefficients, orthogonal polynomials and the WZ-algorithms

โœ Scribed by Jet Wimp

Book ID
110385273
Publisher
Springer US
Year
1999
Tongue
English
Weight
89 KB
Volume
21
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Recurrence relations for the connection
Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable
โœ 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

Minimal recurrence relations for connect
Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
โœ I. Area; E. Godoy; A. Ronveaux; A. Zarzo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 712 KB

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