# recurrence

(0.001 seconds)

## 1—10 of 86 matching pages

##### 1: 16.25 Methods of Computation

…
►Methods for computing the functions of the present chapter include power series, asymptotic expansions, integral representations, differential equations, and recurrence relations.
…There is, however, an added feature in the numerical solution of differential equations and difference equations (recurrence relations).
…In these cases integration, or recurrence, in either a forward or a backward direction is unstable.
…

##### 2: 5.21 Methods of Computation

…
►An effective way of computing $\mathrm{\Gamma}\left(z\right)$ in the right half-plane is backward recurrence, beginning with a value generated from the asymptotic expansion (5.11.3).
Or we can use forward recurrence, with an initial value obtained e.
…For the left half-plane we can continue the backward recurrence or make use of the reflection formula (5.5.3).
…

##### 3: 24.14 Sums

…
►

###### §24.14(i) Quadratic Recurrence Relations

… ►###### §24.14(ii) Higher-Order Recurrence Relations

… ►These identities can be regarded as higher-order recurrences. …##### 4: 33.17 Recurrence Relations and Derivatives

###### §33.17 Recurrence Relations and Derivatives

…##### 5: 24.5 Recurrence Relations

###### §24.5 Recurrence Relations

…##### 6: 8.25 Methods of Computation

…
►

###### §8.25(v) Recurrence Relations

… ►An efficient procedure, based partly on the recurrence relations (8.8.5) and (8.8.6), is described in Gautschi (1979b, 1999). …##### 7: 10.29 Recurrence Relations and Derivatives

##### 8: 10.51 Recurrence Relations and Derivatives

###### §10.51 Recurrence Relations and Derivatives

… ►
$$n{f}_{n-1}(z)-(n+1){f}_{n+1}(z)=(2n+1){f}_{n}^{\prime}(z),$$
$n=1,2,\mathrm{\dots}$,

…
►
$$n{g}_{n-1}(z)+(n+1){g}_{n+1}(z)=(2n+1){g}_{n}^{\prime}(z),$$
$n=1,2,\mathrm{\dots}$,

…
##### 9: 33.23 Methods of Computation

…
►