About the Project

%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%EF%BF%BD%20Art%20diploma%EF%BF%BD%EF%BF%BD%EF%BF%BDWeChat%EF%BF%BD%EF%BF%BD%EF%BF%BDaptao168%EF%BF%BD%EF%BF%BD%EF%BF%BD8Yk6Uo

AdvancedHelp

(0.012 seconds)

11—20 of 111 matching pages

11: 33.24 Tables
  • Abramowitz and Stegun (1964, Chapter 14) tabulates F 0 ( η , ρ ) , G 0 ( η , ρ ) , F 0 ( η , ρ ) , and G 0 ( η , ρ ) for η = 0.5 ( .5 ) 20 and ρ = 1 ( 1 ) 20 , 5S; C 0 ( η ) for η = 0 ( .05 ) 3 , 6S.

  • 12: 27.15 Chinese Remainder Theorem
    Their product m has 20 digits, twice the number of digits in the data. …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: 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.

  • 15: Peter L. Walker
    16: Staff
  • William P. Reinhardt, University of Washington, Chaps. 20, 22, 23

  • 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

  • 17: Bibliography K
  • W. Kahan (1987) Branch Cuts for Complex Elementary Functions or Much Ado About Nothing’s Sign Bit. In The State of the Art in Numerical Analysis (Birmingham, 1986), A. Iserles and M. J. D. Powell (Eds.), Inst. Math. Appl. Conf. Ser. New Ser., Vol. 9, pp. 165–211.
  • 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.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • D. E. Knuth (1968) The Art of Computer Programming. Vol. 1: Fundamental Algorithms. 1st edition, Addison-Wesley Publishing Co., Reading, MA-London-Don Mills, Ont.
  • 18: 10.75 Tables
  • Bickley et al. (1952) tabulates J n ( x ) , Y n ( x ) or x n Y n ( x ) , n = 2 ( 1 ) 20 , x = 0 ( .01 or .1 ) 10 ( .1 ) 25 , 8D (for J n ( x ) ), 8S (for Y n ( x ) or x n Y n ( x ) ); J n ( x ) , Y n ( x ) , n = 0 ( 1 ) 20 , x = 0 or 0.1 ( .1 ) 25 , 10D (for J n ( x ) ), 10S (for Y n ( x ) ).

  • The main tables in Abramowitz and Stegun (1964, Chapter 9) give J 0 ( x ) to 15D, J 1 ( x ) , J 2 ( x ) , Y 0 ( x ) , Y 1 ( x ) to 10D, Y 2 ( x ) to 8D, x = 0 ( .1 ) 17.5 ; Y n ( x ) ( 2 / π ) J n ( x ) ln x , n = 0 , 1 , x = 0 ( .1 ) 2 , 8D; J n ( x ) , Y n ( x ) , n = 3 ( 1 ) 9 , x = 0 ( .2 ) 20 , 5D or 5S; J n ( x ) , Y n ( x ) , n = 0 ( 1 ) 20 ( 10 ) 50 , 100 , x = 1 , 2 , 5 , 10 , 50 , 100 , 10S; modulus and phase functions x M n ( x ) , θ n ( x ) x , n = 0 , 1 , 2 , 1 / x = 0 ( .01 ) 0.1 , 8D.

  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Zhang and Jin (1996, pp. 185–195) tabulates J n ( x ) , J n ( x ) , Y n ( x ) , Y n ( x ) , n = 0 ( 1 ) 10 ( 10 ) 50 , 100 , x = 1 , 5, 10, 25, 50, 100, 9S; J n + α ( x ) , J n + α ( x ) , Y n + α ( x ) , Y n + α ( x ) , n = 0 ( 1 ) 5 , 10 , 30 , 50 , 100 , α = 1 4 , 1 3 , 1 2 , 2 3 , 3 4 , x = 1 , 5 , 10 , 50 , 8S; real and imaginary parts of J n + α ( z ) , J n + α ( z ) , Y n + α ( z ) , Y n + α ( z ) , n = 0 ( 1 ) 15 , 20 ( 10 ) 50 , 100 , α = 0 , 1 2 , z = 4 + 2 i , 20 + 10 i , 8S.

  • Olver (1960) tabulates j n , m , J n ( j n , m ) , j n , m , J n ( j n , m ) , y n , m , Y n ( y n , m ) , y n , m , Y n ( y n , m ) , n = 0 ( 1 2 ) 20 1 2 , m = 1 ( 1 ) 50 , 8D. Also included are tables of the coefficients in the uniform asymptotic expansions of these zeros and associated values as n ; see §10.21(viii), and more fully Olver (1954).

  • 19: 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. …
    20: 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.