About the Project

Richmond%20()%20Fake%20Driver%20License%E3%80%90%E4%BB%BF%E8%AF%81%E5%BE%AECXFK69%E3%80%91H12eGSA

AdvancedHelp

(0.006 seconds)

11—20 of 529 matching pages

11: Bibliography C
  • R. Chelluri, L. B. Richmond, and N. M. Temme (2000) Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.
  • W. J. Cody (1965b) Chebyshev polynomial expansions of complete elliptic integrals. Math. Comp. 19 (90), pp. 249–259.
  • W. J. Cody (1993b) Algorithm 715: SPECFUN – A portable FORTRAN package of special function routines and test drivers. ACM Trans. Math. Software 19 (1), pp. 22–32.
  • 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: 27.15 Chinese Remainder Theorem
    Most of the calculation can be done with five-digit integers as follows. …Their product m has 20 digits, twice the number of digits in the data. By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. Because each residue has no more than five digits, the arithmetic can be performed efficiently on these residues with respect to each of the moduli, yielding answers a 1 ( mod m 1 ) , a 2 ( mod m 2 ) , a 3 ( mod m 3 ) , and a 4 ( mod m 4 ) , where each a j has no more than five digits. These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
    13: William P. Reinhardt
  • In November 2015, Reinhardt was named Senior Associate Editor of the DLMF and Associate Editor for Chapters 20, 22, and 23.
    14: Staff
  • William P. Reinhardt, University of Washington, Chaps. 20, 22, 23

  • Ian J. Thompson, Lawrence Livermore National Laboratory, Chap. 33

  • Peter L. Walker, American University of Sharjah, Chaps. 20, 22, 23

  • William P. Reinhardt, University of Washington, for Chaps. 20, 22, 23

  • Peter L. Walker, American University of Sharjah, for Chaps. 20, 22, 23

  • 15: 6.19 Tables
  • Zhang and Jin (1996, pp. 652, 689) includes Si ( x ) , Ci ( x ) , x = 0 ( .5 ) 20 ( 2 ) 30 , 8D; Ei ( x ) , E 1 ( x ) , x = [ 0 , 100 ] , 8S.

  • Abramowitz and Stegun (1964, Chapter 5) includes the real and imaginary parts of z e z E 1 ( z ) , x = 19 ( 1 ) 20 , y = 0 ( 1 ) 20 , 6D; e z E 1 ( z ) , x = 4 ( .5 ) 2 , y = 0 ( .2 ) 1 , 6D; E 1 ( z ) + ln z , x = 2 ( .5 ) 2.5 , y = 0 ( .2 ) 1 , 6D.

  • Zhang and Jin (1996, pp. 690–692) includes the real and imaginary parts of E 1 ( z ) , ± x = 0.5 , 1 , 3 , 5 , 10 , 15 , 20 , 50 , 100 , y = 0 ( .5 ) 1 ( 1 ) 5 ( 5 ) 30 , 50 , 100 , 8S.

  • 16: Peter L. Walker
    17: 10.75 Tables
  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Bickley et al. (1952) tabulates x n I n ( x ) or e x I n ( x ) , x n K n ( x ) or e x K n ( x ) , n = 2 ( 1 ) 20 , x = 0 (.01 or .1) 10(.1) 20, 8S; I n ( x ) , K n ( x ) , n = 0 ( 1 ) 20 , x = 0 or 0.1 ( .1 ) 20 , 10S.

  • Kerimov and Skorokhodov (1984b) tabulates all zeros of the principal values of K n ( z ) and K n ( z ) , for n = 2 ( 1 ) 20 , 9S.

  • Zhang and Jin (1996, p. 322) tabulates ber x , ber x , bei x , bei x , ker x , ker x , kei x , kei x , x = 0 ( 1 ) 20 , 7S.

  • Zhang and Jin (1996, p. 323) tabulates the first 20 real zeros of ber x , ber x , bei x , bei x , ker x , ker x , kei x , kei x , 8D.

  • 18: 24.20 Tables
    Wagstaff (1978) gives complete prime factorizations of N n and E n for n = 20 ( 2 ) 60 and n = 8 ( 2 ) 42 , respectively. …
    19: 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, p. 25) gives a Chebyshev expansion near infinity for the confluent hypergeometric U -function (§13.2(i)) from which Chebyshev expansions near infinity for E 1 ( z ) , f ( z ) , and g ( z ) follow by using (6.11.2) and (6.11.3). Luke also includes a recursion scheme for computing the coefficients in the expansions of the U functions. If | ph z | < π the scheme can be used in backward direction.

  • 20: Foreword
    That 1046-page tome proved to be an invaluable reference for the many scientists and engineers who use the special functions of applied mathematics in their day-to-day work, so much so that it became the most widely distributed and most highly cited NIST publication in the first 100 years of the institution’s existence. … November 20, 2009 …