About the Project

Bailey%E2%80%93Daum%20q-Kummer%20sum

AdvancedHelp

(0.003 seconds)

21—30 of 435 matching pages

21: 18.18 Sums
§18.18(vi) Bateman-Type Sums
Jacobi
For the Poisson kernel of Jacobi polynomials (the Bailey formula) see Bailey (1938).
§18.18(viii) Other Sums
22: Bibliography H
  • P. I. Hadži (1973) The Laplace transform for expressions that contain a probability function. Bul. Akad. Štiince RSS Moldoven. 1973 (2), pp. 78–80, 93 (Russian).
  • P. I. Hadži (1976a) Expansions for the probability function in series of Čebyšev polynomials and Bessel functions. Bul. Akad. Štiince RSS Moldoven. 1976 (1), pp. 77–80, 96 (Russian).
  • P. I. Hadži (1976b) Integrals that contain a probability function of complicated arguments. Bul. Akad. Štiince RSS Moldoven. 1976 (1), pp. 80–84, 96 (Russian).
  • P. I. Hadži (1978) Sums with cylindrical functions that reduce to the probability function and to related functions. Bul. Akad. Shtiintse RSS Moldoven. 1978 (3), pp. 80–84, 95 (Russian).
  • D. R. Hartree (1936) Some properties and applications of the repeated integrals of the error function. Proc. Manchester Lit. Philos. Soc. 80, pp. 85–102.
  • 23: Bibliography D
  • K. Dilcher (1987b) Irreducibility of certain generalized Bernoulli polynomials belonging to quadratic residue class characters. J. Number Theory 25 (1), pp. 72–80.
  • B. Döring (1966) Complex zeros of cylinder functions. Math. Comp. 20 (94), pp. 215–222.
  • B. A. Dubrovin (1981) Theta functions and non-linear equations. Uspekhi Mat. Nauk 36 (2(218)), pp. 11–80 (Russian).
  • T. M. Dunster (1997) Error analysis in a uniform asymptotic expansion for the generalised exponential integral. J. Comput. Appl. Math. 80 (1), pp. 127–161.
  • T. M. Dunster (2001b) Uniform asymptotic expansions for Charlier polynomials. J. Approx. Theory 112 (1), pp. 93–133.
  • 24: Bibliography K
  • K. W. J. Kadell (1994) A proof of the q -Macdonald-Morris conjecture for B C n . Mem. Amer. Math. Soc. 108 (516), pp. vi+80.
  • E. H. Kaufman and T. D. Lenker (1986) Linear convergence and the bisection algorithm. Amer. Math. Monthly 93 (1), pp. 48–51.
  • 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.
  • 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.
  • 25: 10.31 Power Series
    10.31.1 K n ( z ) = 1 2 ( 1 2 z ) n k = 0 n 1 ( n k 1 ) ! k ! ( 1 4 z 2 ) k + ( 1 ) n + 1 ln ( 1 2 z ) I n ( z ) + ( 1 ) n 1 2 ( 1 2 z ) n k = 0 ( ψ ( k + 1 ) + ψ ( n + k + 1 ) ) ( 1 4 z 2 ) k k ! ( n + k ) ! ,
    10.31.3 I ν ( z ) I μ ( z ) = ( 1 2 z ) ν + μ k = 0 ( ν + μ + k + 1 ) k ( 1 4 z 2 ) k k ! Γ ( ν + k + 1 ) Γ ( μ + k + 1 ) .
    26: 32.8 Rational Solutions
    32.8.3 w ( z ; 3 ) = 3 z 2 z 3 + 4 6 z 2 ( z 3 + 10 ) z 6 + 20 z 3 80 ,
    32.8.4 w ( z ; 4 ) = 1 z + 6 z 2 ( z 3 + 10 ) z 6 + 20 z 3 80 9 z 5 ( z 3 + 40 ) z 9 + 60 z 6 + 11200 .
    Q 3 ( z ) = z 6 + 20 z 3 80 ,
    32.8.8 m = 0 p m ( z ) λ m = exp ( z λ 4 3 λ 3 ) .
    27: 26.13 Permutations: Cycle Notation
    26.13.4 d ( n ) = n ! j = 0 n ( 1 ) j 1 j ! = n ! + e 2 e .
    28: 8.23 Statistical Applications
    In queueing theory the Erlang loss function is used, which can be expressed in terms of the reciprocal of Q ( a , x ) ; see Jagerman (1974) and Cooper (1981, pp. 80, 316–319). …
    29: 26.6 Other Lattice Path Numbers
    26.6.1 D ( m , n ) = k = 0 n ( n k ) ( m + n k n ) = k = 0 n 2 k ( m k ) ( n k ) .
    26.6.5 m , n = 0 D ( m , n ) x m y n = 1 1 x y x y ,
    26.6.6 n = 0 D ( n , n ) x n = 1 1 6 x + x 2 ,
    26.6.9 n = 0 r ( n ) x n = 1 x 1 6 x + x 2 2 x .
    26.6.12 C ( n ) = k = 1 n N ( n , k ) ,
    30: 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.