✦ LIBER ✦

Is the recurrence relation for orthogonal polynomials always stable?

✍ Scribed by Walter Gautschi

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 462 KB
Volume: 33
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01989750

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotics for orthogonal polynomials d

Asymptotics for orthogonal polynomials defined by a recurrence relation

✍ Attila Máté; Paul Nevai; Vilmos Totik 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 648 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

A “differential” derivation of the recur

A “differential” derivation of the recurrence relations for the classical orthogonal polynomials

✍ S.Yu. Slavyanov 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 233 KB

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

Formulas for recurrence coefficients of

Formulas for recurrence coefficients of orthogonal polynomials related to Lorentzian-like weights

✍ Alphonse P. Magnus; Viviane Pierrard 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 211 KB

One considers the recurrence relation of orthogonal polynomials related to weights |t| A (1 + t 2r /c 2r ) -B on the whole real line, for various integer exponents 2r, and real A > -1, B > 0.

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