✦ LIBER ✦

Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case

✍ Scribed by I. Area; E. Godoy; A. Ronveaux; A. Zarzo

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 693 KB
Volume: 89
Category: Article
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(98)00002-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Recurrence relations for the connection

Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable on the lattice x(s) = q2s

✍ Stanislaw Lewanowicz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Second-order recurrence relation for the

Second-order recurrence relation for the linearization coefficients of the classical orthogonal polynomials

✍ Stanisław Lewanowicz 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 418 KB