About the Project

large%20%CE%BA

AdvancedHelp

(0.001 seconds)

11—20 of 229 matching pages

11: 14.26 Uniform Asymptotic Expansions
§14.26 Uniform Asymptotic Expansions
12: 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. …
13: 11.6 Asymptotic Expansions
§11.6(i) Large | z | , Fixed ν
§11.6(ii) Large | ν | , Fixed z
§11.6(iii) Large | ν | , Fixed z / ν
c 3 ( λ ) = 20 λ 6 4 λ 4 ,
14: Bibliography F
  • S. Farid Khwaja and A. B. Olde Daalhuis (2014) Uniform asymptotic expansions for hypergeometric functions with large parameters IV. Anal. Appl. (Singap.) 12 (6), pp. 667–710.
  • C. Ferreira, J. L. López, and E. Pérez Sinusía (2013a) The third Appell function for one large variable. J. Approx. Theory 165, pp. 60–69.
  • C. Ferreira, J. L. López, and E. Pérez Sinusía (2005) Incomplete gamma functions for large values of their variables. Adv. in Appl. Math. 34 (3), pp. 467–485.
  • C. Ferreira, J. L. López, and E. P. Sinusía (2013b) The second Appell function for one large variable. Mediterr. J. Math. 10 (4), pp. 1853–1865.
  • J. L. Fields (1973) Uniform asymptotic expansions of certain classes of Meijer G -functions for a large parameter. SIAM J. Math. Anal. 4 (3), pp. 482–507.
  • 15: 33.18 Limiting Forms for Large
    §33.18 Limiting Forms for Large
    16: 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.

  • Luke (1969b, pp. 402, 410, and 415–421) gives main diagonal Padé approximations for Ein ( z ) , Si ( z ) , Cin ( z ) (valid near the origin), and E 1 ( z ) (valid for large | z | ); approximate errors are given for a selection of z -values.

  • 17: 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. …
    18: 12.10 Uniform Asymptotic Expansions for Large Parameter
    §12.10 Uniform Asymptotic Expansions for Large Parameter
    §12.10(vi) Modifications of Expansions in Elementary Functions
    Modified Expansions
    19: 20 Theta Functions
    Chapter 20 Theta Functions
    20: 12.16 Mathematical Applications