About the Project

zengő recurrence relations

AdvancedHelp

(0.002 seconds)

1—10 of 336 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: Bibliography Z
  • F. A. Zafiropoulos, T. N. Grapsa, O. Ragos, and M. N. Vrahatis (1996) On the Computation of Zeros of Bessel and Bessel-related Functions. In Proceedings of the Sixth International Colloquium on Differential Equations (Plovdiv, Bulgaria, 1995), D. Bainov (Ed.), Utrecht, pp. 409–416.
  • D. Zagier (1989) The Dilogarithm Function in Geometry and Number Theory. In Number Theory and Related Topics (Bombay, 1988), R. Askey and others (Eds.), Tata Inst. Fund. Res. Stud. Math., Vol. 12, pp. 231–249.
  • J. Zeng (1992) Weighted derangements and the linearization coefficients of orthogonal Sheffer polynomials. Proc. London Math. Soc. (3) 65 (1), pp. 1–22.
  • 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
    §24.5(i) Basic 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
    §10.29 Recurrence Relations and Derivatives
    §10.29(i) Recurrence Relations
    8: 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 , ,
    9: 18.9 Recurrence Relations and Derivatives
    §18.9 Recurrence Relations and Derivatives
    §18.9(i) Recurrence Relations
    with initial values p 0 ( x ) = 1 and p 1 ( x ) = A 0 x + B 0 . … with initial values p 0 ( x ) = 1 and p 1 ( x ) = a 0 1 ( x b 0 ) . … and the structure relation
    10: 33.4 Recurrence Relations and Derivatives
    §33.4 Recurrence Relations and Derivatives