About the Project

picture%20of%20Stokes%20set

AdvancedHelp

(0.004 seconds)

21—30 of 609 matching pages

21: 25.12 Polylogarithms
25.12.2 Li 2 ( z ) = 0 z t 1 ln ( 1 t ) d t , z ( 1 , ) .
25.12.3 Li 2 ( z ) + Li 2 ( z z 1 ) = 1 2 ( ln ( 1 z ) ) 2 , z [ 1 , ) .
See accompanying text
Figure 25.12.1: Dilogarithm function Li 2 ( x ) , 20 x < 1 . Magnify
See accompanying text
Figure 25.12.2: Absolute value of the dilogarithm function | Li 2 ( x + i y ) | , 20 x 20 , 20 y 20 . … Magnify 3D Help
Sometimes the factor 1 / Γ ( s + 1 ) is omitted. …
22: 9.18 Tables
  • Miller (1946) tabulates Ai ( x ) , Ai ( x ) for x = 20 ( .01 ) 2 ; log 10 Ai ( x ) , Ai ( x ) / Ai ( x ) for x = 0 ( .1 ) 25 ( 1 ) 75 ; Bi ( x ) , Bi ( x ) for x = 10 ( .1 ) 2.5 ; log 10 Bi ( x ) , Bi ( x ) / Bi ( x ) for x = 0 ( .1 ) 10 ; M ( x ) , N ( x ) , θ ( x ) , ϕ ( x ) (respectively F ( x ) , G ( x ) , χ ( x ) , ψ ( x ) ) for x = 80 ( 1 ) 30 ( .1 ) 0 . Precision is generally 8D; slightly less for some of the auxiliary functions. Extracts from these tables are included in Abramowitz and Stegun (1964, Chapter 10), together with some auxiliary functions for large arguments.

  • Zhang and Jin (1996, p. 337) tabulates Ai ( x ) , Ai ( x ) , Bi ( x ) , Bi ( x ) for x = 0 ( 1 ) 20 to 8S and for x = 20 ( 1 ) 0 to 9D.

  • Miller (1946) tabulates a k , Ai ( a k ) , a k , Ai ( a k ) , k = 1 ( 1 ) 50 ; b k , Bi ( b k ) , b k , Bi ( b k ) , k = 1 ( 1 ) 20 . Precision is 8D. Entries for k = 1 ( 1 ) 20 are reproduced in Abramowitz and Stegun (1964, Chapter 10).

  • Sherry (1959) tabulates a k , Ai ( a k ) , a k , Ai ( a k ) , k = 1 ( 1 ) 50 ; 20S.

  • Zhang and Jin (1996, p. 339) tabulates a k , Ai ( a k ) , a k , Ai ( a k ) , b k , Bi ( b k ) , b k , Bi ( b k ) , k = 1 ( 1 ) 20 ; 8D.

  • 23: 27.2 Functions
    Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … Gauss and Legendre conjectured that π ( x ) is asymptotic to x / ln x as x : … Such a set is a reduced residue system modulo n . …
    Table 27.2.2: Functions related to division.
    n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n )
    5 4 2 6 18 6 6 39 31 30 2 32 44 20 6 84
    7 6 2 8 20 8 6 42 33 20 4 48 46 22 4 72
    24: 2.11 Remainder Terms; Stokes Phenomenon
    §2.11 Remainder Terms; Stokes Phenomenon
    §2.11(iv) Stokes Phenomenon
    Where should the change-over take place? Can it be accomplished smoothly? … For higher-order Stokes phenomena see Olde Daalhuis (2004b) and Howls et al. (2004). … For example, using double precision d 20 is found to agree with (2.11.31) to 13D. …
    25: 6.20 Approximations
  • Cody and Thacher (1968) provides minimax rational approximations for E 1 ( x ) , with accuracies up to 20S.

  • Cody and Thacher (1969) provides minimax rational approximations for Ei ( x ) , with accuracies up to 20S.

  • MacLeod (1996b) provides rational approximations for the sine and cosine integrals and for the auxiliary functions f and g , with accuracies up to 20S.

  • 26: Foreword
    November 20, 2009 …
    27: 13.30 Tables
  • Zhang and Jin (1996, pp. 411–423) tabulates M ( a , b , x ) and U ( a , b , x ) for a = 5 ( .5 ) 5 , b = 0.5 ( .5 ) 5 , and x = 0.1 , 1 , 5 , 10 , 20 , 30 , 8S (for M ( a , b , x ) ) and 7S (for U ( a , b , x ) ).

  • 28: 28.16 Asymptotic Expansions for Large q
    28.16.1 λ ν ( h 2 ) 2 h 2 + 2 s h 1 8 ( s 2 + 1 ) 1 2 7 h ( s 3 + 3 s ) 1 2 12 h 2 ( 5 s 4 + 34 s 2 + 9 ) 1 2 17 h 3 ( 33 s 5 + 410 s 3 + 405 s ) 1 2 20 h 4 ( 63 s 6 + 1260 s 4 + 2943 s 2 + 486 ) 1 2 25 h 5 ( 527 s 7 + 15617 s 5 + 69001 s 3 + 41607 s ) + .
    29: 25.20 Approximations
  • Cody et al. (1971) gives rational approximations for ζ ( s ) in the form of quotients of polynomials or quotients of Chebyshev series. The ranges covered are 0.5 s 5 , 5 s 11 , 11 s 25 , 25 s 55 . Precision is varied, with a maximum of 20S.

  • Antia (1993) gives minimax rational approximations for Γ ( s + 1 ) F s ( x ) , where F s ( x ) is the Fermi–Dirac integral (25.12.14), for the intervals < x 2 and 2 x < , with s = 1 2 , 1 2 , 3 2 , 5 2 . For each s there are three sets of approximations, with relative maximum errors 10 4 , 10 8 , 10 12 .

  • 30: Bibliography K
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • T. H. Koornwinder (2009) The Askey scheme as a four-manifold with corners. Ramanujan J. 20 (3), pp. 409–439.
  • C. Krattenthaler (1993) HYP and HYPQ. Mathematica packages for the manipulation of binomial sums and hypergeometric series respectively q -binomial sums and basic hypergeometric series. Séminaire Lotharingien de Combinatoire 30, pp. 61–76.