About the Project
NIST

recurrence relations

AdvancedHelp

(0.002 seconds)

1—10 of 79 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). …
2: 24.14 Sums
§24.14(i) Quadratic Recurrence Relations
§24.14(ii) Higher-Order Recurrence Relations
3: 33.17 Recurrence Relations and Derivatives
§33.17 Recurrence Relations and Derivatives
4: 24.5 Recurrence Relations
§24.5 Recurrence Relations
5: 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). …
6: 10.29 Recurrence Relations and Derivatives
§10.29 Recurrence Relations and Derivatives
§10.29(i) Recurrence Relations
7: 10.51 Recurrence Relations and Derivatives
§10.51 Recurrence Relations and Derivatives
n f n - 1 ( z ) - ( n + 1 ) f n + 1 ( z ) = ( 2 n + 1 ) f n ( z ) , n = 1 , 2 , ,
n g n - 1 ( z ) + ( n + 1 ) g n + 1 ( z ) = ( 2 n + 1 ) g n ( z ) , n = 1 , 2 , ,
8: 33.4 Recurrence Relations and Derivatives
§33.4 Recurrence Relations and Derivatives
9: 12.8 Recurrence Relations and Derivatives
§12.8 Recurrence Relations and Derivatives
§12.8(i) Recurrence Relations
10: 18.9 Recurrence Relations and Derivatives
§18.9 Recurrence Relations and Derivatives
§18.9(i) Recurrence Relations
Table 18.9.1: Classical OP’s: recurrence relations (18.9.1).
p n ( x ) A n B n C n