About the Project

Szegő recurrence relations

AdvancedHelp

(0.002 seconds)

11—20 of 335 matching pages

11: 26.5 Lattice Paths: Catalan Numbers
§26.5(i) Definitions
§26.5(iii) Recurrence Relations
12: 5.5 Functional Relations
§5.5 Functional Relations
§5.5(i) Recurrence
5.5.1 Γ ( z + 1 ) = z Γ ( z ) ,
13: 12.8 Recurrence Relations and Derivatives
§12.8 Recurrence Relations and Derivatives
§12.8(i) Recurrence Relations
14: 14.10 Recurrence Relations and Derivatives
§14.10 Recurrence Relations and Derivatives
15: 32.15 Orthogonal Polynomials
with recurrence relation …Then u n ( z ) = ( a n ( z ) ) 2 satisfies the nonlinear recurrence relation
16: 13.27 Mathematical Applications
This identification can be used to obtain various properties of the Whittaker functions, including recurrence relations and derivatives. …
17: 14.32 Methods of Computation
In other cases recurrence relations14.10) provide a powerful method when applied in a stable direction (§3.6); see Olver and Smith (1983) and Gautschi (1967). …
18: 10.6 Recurrence Relations and Derivatives
§10.6 Recurrence Relations and Derivatives
§10.6(i) Recurrence Relations
§10.6(iii) Cross-Products
19: 26.3 Lattice Paths: Binomial Coefficients
§26.3(i) Definitions
§26.3(iii) Recurrence Relations
20: 3.10 Continued Fractions
Forward Recurrence Algorithm
The A n and B n of (3.10.2) can be computed by means of three-term recurrence relations (1.12.5). …
Backward Recurrence Algorithm
Forward Series Recurrence Algorithm
This forward algorithm achieves efficiency and stability in the computation of the convergents C n = A n / B n , and is related to the forward series recurrence algorithm. …