✦ LIBER ✦

On recurrence relations for multipole coefficients

✍ Scribed by R. W. James

Publisher: Springer
Year: 1967
Tongue: English
Weight: 261 KB
Volume: 68
Category: Article
ISSN: 0033-4533
DOI: 10.1007/bf00874886

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recurrence relations for calculation of

Recurrence relations for calculation of the Cartesian multipole tensor

✍ Matt Challacombe; Eric Schwegler; Jan Almlöf 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 404 KB

We demonstrate that the Cartesian multipole interaction tensor may be evaluated with recurrence relations analogous to the McMurchie-Davidson algorithm for calculation of electron repulsion integrals. With these recursion relations all elements of the Cartesian multipole tensor through order 2' may

Recurrence relations for the coefficient

Recurrence relations for the coefficients of a modular curve

✍ V. A. Dem'yanenko 📂 Article 📅 1981 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 210 KB

On recurrence relations for order statis

On recurrence relations for order statistics

✍ H.A. David 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 255 KB

On Certain Recurrence Relations

✍ Mrs Aruna Srivastava; K. C. Gupta 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB

I n this paper first we establish six recurrence relations for the H-function with the help of certain formulae concerning generalized BESSEL function. Later on, we obtain recurrence relations for MEIJER'S G-function, GAUSS'S hypergeometric function and BESSEI. function. On account of the general ch

Zeros of polynomials and recurrence rela

Zeros of polynomials and recurrence relations with periodic coefficients

✍ Jacek Gilewicz; Elie Leopold 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The location of all zeros of a ÿnite family of polynomials deÿned by three term recurrence relations with periodic coe cients is analyzed with the help of reference to the Chebyshev polynomials. In some particular cases the distribution of these zeros in the gaps between the intervals which support

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