About the Project

limiting%20form%20as%20a%20Bessel%20function

AdvancedHelp

(0.008 seconds)

11—20 of 1013 matching pages

11: Bibliography C
  • F. Calogero (1978) Asymptotic behaviour of the zeros of the (generalized) Laguerre polynomial L n α ( x )  as the index α  and limiting formula relating Laguerre polynomials of large index and large argument to Hermite polynomials. Lett. Nuovo Cimento (2) 23 (3), pp. 101–102.
  • P. L. Chebyshev (1851) Sur la fonction qui détermine la totalité des nombres premiers inférieurs à une limite donnée. Mem. Ac. Sc. St. Pétersbourg 6, pp. 141–157.
  • R. Chelluri, L. B. Richmond, and N. M. Temme (2000) Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.
  • M. Colman, A. Cuyt, and J. Van Deun (2011) Validated computation of certain hypergeometric functions. ACM Trans. Math. Software 38 (2), pp. Art. 11, 20.
  • M. D. Cooper, R. H. Jeppesen, and M. B. Johnson (1979) Coulomb effects in the Klein-Gordon equation for pions. Phys. Rev. C 20 (2), pp. 696–704.
  • 12: 26.12 Plane Partitions
    A plane partition, π , of a positive integer n , is a partition of n in which the parts have been arranged in a 2-dimensional array that is weakly decreasing (nonincreasing) across rows and down columns. … The plane partition in Figure 26.12.1 is an example of a cyclically symmetric plane partition. … A plane partition is totally symmetric if it is both symmetric and cyclically symmetric. … The example of a strict shifted plane partition also satisfies the conditions of a descending plane partition. …
    §26.12(iv) Limiting Form
    13: 35.5 Bessel Functions of Matrix Argument
    §35.5 Bessel Functions of Matrix Argument
    §35.5(i) Definitions
    §35.5(ii) Properties
    §35.5(iii) Asymptotic Approximations
    For asymptotic approximations for Bessel functions of matrix argument, see Herz (1955) and Butler and Wood (2003).
    14: 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.

  • Pagurova (1963) tabulates P ( a , x ) and Q ( a , x ) (with different notation) for a = 0 ( .05 ) 3 , x = 0 ( .05 ) 1 to 7D.

  • 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.

  • 15: 6.16 Mathematical Applications
    These limits are not approached uniformly, however. …Hence if x = π / ( 2 n ) and n , then the limiting value of S n ( x ) overshoots 1 4 π by approximately 18%. Similarly if x = π / n , then the limiting value of S n ( x ) undershoots 1 4 π by approximately 10%, and so on. … It occurs with Fourier-series expansions of all piecewise continuous functions. … …
    16: 33.18 Limiting Forms for Large
    §33.18 Limiting Forms for Large
    17: 23 Weierstrass Elliptic and Modular
    Functions
    Chapter 23 Weierstrass Elliptic and Modular Functions
    18: 18.40 Methods of Computation
    Orthogonal polynomials can be computed from their explicit polynomial form by Horner’s scheme (§1.11(i)). … Given the power moments, μ n = a b x n d μ ( x ) , n = 0 , 1 , 2 , , can these be used to find a unique μ ( x ) , a non-decreasing, real, function of x , in the case that the moment problem is determined? Should a unique solution not exist the moment problem is then indeterminant. … It is now necessary to take the limit ε 0 + of F ( x + i ε ) , and the imaginary part is the required Stieltjes–Perron inversion: …Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . Gautschi (2004, p. 119–120) has explored the ε 0 + limit via the Wynn ε -algorithm, (3.9.11) to accelerate convergence, finding four to eight digits of precision in w ( x ) , depending smoothly on x , for N 4000 , for an example involving first numerator Legendre OP’s. …
    19: Bibliography N
  • D. Naylor (1989) On an integral transform involving a class of Mathieu functions. SIAM J. Math. Anal. 20 (6), pp. 1500–1513.
  • W. J. Nellis and B. C. Carlson (1966) Reduction and evaluation of elliptic integrals. Math. Comp. 20 (94), pp. 223–231.
  • T. D. Newton (1952) Coulomb Functions for Large Values of the Parameter η . Technical report Atomic Energy of Canada Limited, Chalk River, Ontario.
  • E. W. Ng and M. Geller (1969) A table of integrals of the error functions. J. Res. Nat. Bur. Standards Sect B. 73B, pp. 1–20.
  • A. F. Nikiforov and V. B. Uvarov (1988) Special Functions of Mathematical Physics: A Unified Introduction with Applications. Birkhäuser Verlag, Basel.
  • 20: 27.2 Functions
    Functions in this section derive their properties from the fundamental theorem of arithmetic, which states that every integer n > 1 can be represented uniquely as a product of prime powers, …Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … An equivalent form states that the n th prime p n (when the primes are listed in increasing order) is asymptotic to n ln n as n : … Such a set is a reduced residue system modulo n . … where p a is a prime power with a 1 ; otherwise Λ ( n ) = 0 . …