About the Project

Parseval%20formula

AdvancedHelp

(0.001 seconds)

21—30 of 306 matching pages

21: Bibliography I
  • K. Inkeri (1959) The real roots of Bernoulli polynomials. Ann. Univ. Turku. Ser. A I 37, pp. 1–20.
  • A. R. Its and A. A. Kapaev (1987) The method of isomonodromic deformations and relation formulas for the second Painlevé transcendent. Izv. Akad. Nauk SSSR Ser. Mat. 51 (4), pp. 878–892, 912 (Russian).
  • A. R. Its and A. A. Kapaev (1998) Connection formulae for the fourth Painlevé transcendent; Clarkson-McLeod solution. J. Phys. A 31 (17), pp. 4073–4113.
  • 22: 18.5 Explicit Representations
    §18.5(ii) Rodrigues Formulas
    Related formula: …See (Erdélyi et al., 1953b, §10.9(37)) for a related formula for ultraspherical polynomials. … and two similar formulas by symmetry; compare the second row in Table 18.6.1. … For corresponding formulas for Chebyshev, Legendre, and the Hermite 𝐻𝑒 n polynomials apply (18.7.3)–(18.7.6), (18.7.9), and (18.7.11). …
    23: Bibliography O
  • F. Oberhettinger (1973) Fourier Expansions. A Collection of Formulas. Academic Press, New York-London.
  • J. Oliver (1977) An error analysis of the modified Clenshaw method for evaluating Chebyshev and Fourier series. J. Inst. Math. Appl. 20 (3), pp. 379–391.
  • F. W. J. Olver (1977a) Connection formulas for second-order differential equations with multiple turning points. SIAM J. Math. Anal. 8 (1), pp. 127–154.
  • F. W. J. Olver (1977b) Connection formulas for second-order differential equations having an arbitrary number of turning points of arbitrary multiplicities. SIAM J. Math. Anal. 8 (4), pp. 673–700.
  • F. W. J. Olver (1978) General connection formulae for Liouville-Green approximations in the complex plane. Philos. Trans. Roy. Soc. London Ser. A 289, pp. 501–548.
  • 24: 8 Incomplete Gamma and Related
    Functions
    25: 28 Mathieu Functions and Hill’s Equation
    26: 25.6 Integer Arguments
    25.6.3 ζ ( n ) = B n + 1 n + 1 , n = 1 , 2 , 3 , .
    §25.6(iii) Recursion Formulas
    27: Bibliography W
  • P. L. Walker (2012) Reduction formulae for products of theta functions. J. Res. Nat. Inst. Standards and Technology 117, pp. 297–303.
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • J. Wimp (1968) Recursion formulae for hypergeometric functions. Math. Comp. 22 (102), pp. 363–373.
  • J. Wimp (1987) Explicit formulas for the associated Jacobi polynomials and some applications. Canad. J. Math. 39 (4), pp. 983–1000.
  • R. Wong (1982) Quadrature formulas for oscillatory integral transforms. Numer. Math. 39 (3), pp. 351–360.
  • 28: 8.26 Tables
  • Khamis (1965) tabulates P ( a , x ) for a = 0.05 ( .05 ) 10 ( .1 ) 20 ( .25 ) 70 , 0.0001 x 250 to 10D.

  • Abramowitz and Stegun (1964, pp. 245–248) tabulates E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x = 0 ( .01 ) 2 to 7D; also ( x + n ) e x E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x 1 = 0 ( .01 ) 0.1 ( .05 ) 0.5 to 6S.

  • Pagurova (1961) tabulates E n ( x ) for n = 0 ( 1 ) 20 , x = 0 ( .01 ) 2 ( .1 ) 10 to 4-9S; e x E n ( x ) for n = 2 ( 1 ) 10 , x = 10 ( .1 ) 20 to 7D; e x E p ( x ) for p = 0 ( .1 ) 1 , x = 0.01 ( .01 ) 7 ( .05 ) 12 ( .1 ) 20 to 7S or 7D.

  • Zhang and Jin (1996, Table 19.1) tabulates E n ( x ) for n = 1 , 2 , 3 , 5 , 10 , 15 , 20 , x = 0 ( .1 ) 1 , 1.5 , 2 , 3 , 5 , 10 , 20 , 30 , 50 , 100 to 7D or 8S.

  • 29: 23 Weierstrass Elliptic and Modular
    Functions
    30: 27.20 Methods of Computation: Other Number-Theoretic Functions
    The recursion formulas (27.14.6) and (27.14.7) can be used to calculate the partition function p ( n ) for n < N . … A recursion formula obtained by differentiating (27.14.18) can be used to calculate Ramanujan’s function τ ( n ) , and the values can be checked by the congruence (27.14.20). …