About the Project

recurrence

AdvancedHelp

(0.001 seconds)

31—40 of 92 matching pages

31: 15.19 Methods of Computation
§15.19(iv) Recurrence Relations
32: 28.14 Fourier Series
28.14.4 q c 2 m + 2 ( a ( ν + 2 m ) 2 ) c 2 m + q c 2 m 2 = 0 , a = λ ν ( q ) , c 2 m = c 2 m ν ( q ) ,
33: 26.6 Other Lattice Path Numbers
§26.6(iii) Recurrence Relations
26.6.10 D ( m , n ) = D ( m , n 1 ) + D ( m 1 , n ) + D ( m 1 , n 1 ) , m , n 1 ,
34: 4.45 Methods of Computation
4.45.8 2 arctan x 1 + ( 1 + x 2 ) 1 / 2 = arctan x , 0 < x < .
4.45.9 x n = x n 1 1 + ( 1 + x n 1 2 ) 1 / 2 , n = 1 , 2 , 3 , ,
35: 13.29 Methods of Computation
§13.29(iv) Recurrence Relations
The recurrence relations in §§13.3(i) and 13.15(i) can be used to compute the confluent hypergeometric functions in an efficient way. …
36: 13.3 Recurrence Relations and Derivatives
§13.3 Recurrence Relations and Derivatives
§13.3(i) Recurrence Relations
37: 5.17 Barnes’ G -Function (Double Gamma Function)
§5.17 Barnes’ G -Function (Double Gamma Function)
38: 18.22 Hahn Class: Recurrence Relations and Differences
§18.22 Hahn Class: Recurrence Relations and Differences
§18.22(i) Recurrence Relations in n
Table 18.22.1: Recurrence relations (18.22.2) for Krawtchouk, Meixner, and Charlier polynomials.
p n ( x ) A n C n
39: Bibliography W
  • X.-S. Wang and R. Wong (2012) Asymptotics of orthogonal polynomials via recurrence relations. Anal. Appl. (Singap.) 10 (2), pp. 215–235.
  • J. A. Wilson (1978) Hypergeometric Series, Recurrence Relations and Some New Orthogonal Polynomials. Ph.D. Thesis, University of Wisconsin, Madison, WI.
  • J. Wimp (1984) Computation with Recurrence Relations. Pitman, Boston, MA.
  • R. Wong (2014) Asymptotics of linear recurrences. Anal. Appl. (Singap.) 12 (4), pp. 463–484.
  • 40: 8.8 Recurrence Relations and Derivatives
    §8.8 Recurrence Relations and Derivatives