About the Project

large %CE%BA

AdvancedHelp

(0.002 seconds)

1—10 of 165 matching pages

1: 16.22 Asymptotic Expansions
Asymptotic expansions of G p , q m , n ( z ; 𝐚 ; 𝐛 ) for large z are given in Luke (1969a, §§5.7 and 5.10) and Luke (1975, §5.9). For asymptotic expansions of Meijer G -functions with large parameters see Fields (1973, 1983).
2: 14.26 Uniform Asymptotic Expansions
§14.26 Uniform Asymptotic Expansions
3: 34.8 Approximations for Large Parameters
§34.8 Approximations for Large Parameters
For large values of the parameters in the 3 j , 6 j , and 9 j symbols, different asymptotic forms are obtained depending on which parameters are large. …
4: 33.18 Limiting Forms for Large
§33.18 Limiting Forms for Large
5: Bibliography H
  • M. H. Halley, D. Delande, and K. T. Taylor (1993) The combination of R -matrix and complex coordinate methods: Application to the diamagnetic Rydberg spectra of Ba and Sr. J. Phys. B 26 (12), pp. 1775–1790.
  • B. A. Hargrave and B. D. Sleeman (1977) Lamé polynomials of large order. SIAM J. Math. Anal. 8 (5), pp. 800–842.
  • C. J. Howls and A. B. Olde Daalhuis (1999) On the resurgence properties of the uniform asymptotic expansion of Bessel functions of large order. Proc. Roy. Soc. London Ser. A 455, pp. 3917–3930.
  • 6: 28.35 Tables
  • Kirkpatrick (1960) contains tables of the modified functions Ce n ( x , q ) , Se n + 1 ( x , q ) for n = 0 ( 1 ) 5 , q = 1 ( 1 ) 20 , x = 0.1 ( .1 ) 1 ; 4D or 5D.

  • National Bureau of Standards (1967) includes the eigenvalues a n ( q ) , b n ( q ) for n = 0 ( 1 ) 3 with q = 0 ( .2 ) 20 ( .5 ) 37 ( 1 ) 100 , and n = 4 ( 1 ) 15 with q = 0 ( 2 ) 100 ; Fourier coefficients for ce n ( x , q ) and se n ( x , q ) for n = 0 ( 1 ) 15 , n = 1 ( 1 ) 15 , respectively, and various values of q in the interval [ 0 , 100 ] ; joining factors g e , n ( q ) , f e , n ( q ) for n = 0 ( 1 ) 15 with q = 0 ( .5  to  10 ) 100 (but in a different notation). Also, eigenvalues for large values of q . Precision is generally 8D.

  • 7: 27.16 Cryptography
    Applications to cryptography rely on the disparity in computer time required to find large primes and to factor large integers. For example, a code maker chooses two large primes p and q of about 400 decimal digits each. …For this reason, the codes are considered unbreakable, at least with the current state of knowledge on factoring large numbers. …
    8: 28.16 Asymptotic Expansions for Large q
    §28.16 Asymptotic Expansions for Large q
    9: 28.20 Definitions and Basic Properties
    §28.20(ii) Solutions Ce ν , Se ν , Me ν , Fe n , Ge n
    28.20.3 Ce ν ( z , q ) = ce ν ( ± i z , q ) , ν 1 , 2 , ,
    §28.20(iii) Solutions M ν ( j )
    10: 12.16 Mathematical Applications