About the Project

repeated%20integrals%20of%20the%20complementary%20error%20function

AdvancedHelp

(0.008 seconds)

11—20 of 979 matching pages

11: 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. Even though the lengthy calculation is repeated four times, once for each modulus, most of it only uses five-digit integers and is accomplished quickly without overwhelming the machine’s memory. …
12: 7.24 Approximations
§7.24(i) Approximations in Terms of Elementary Functions
  • Cody (1969) provides minimax rational approximations for erf x and erfc x . The maximum relative precision is about 20S.

  • Cody et al. (1970) gives minimax rational approximations to Dawson’s integral F ( x ) (maximum relative precision 20S–22S).

  • Shepherd and Laframboise (1981) gives coefficients of Chebyshev series for ( 1 + 2 x ) e x 2 erfc x on ( 0 , ) (22D).

  • Luke (1969b, vol. 2, pp. 422–435) gives main diagonal Padé approximations for F ( z ) , erf z , erfc z , C ( z ) , and S ( z ) ; approximate errors are given for a selection of z -values.

  • 13: 20 Theta Functions
    Chapter 20 Theta Functions
    14: Software Index
    Open Source With Book Commercial
    20 Theta Functions
    ‘✓’ indicates that a software package implements the functions in a section; ‘a’ indicates available functionality through optional or add-on packages; an empty space indicates no known support. … In the list below we identify four main sources of software for computing special functions. …
  • Commercial Software.

    Such software ranges from a collection of reusable software parts (e.g., a library) to fully functional interactive computing environments with an associated computing language. Such software is usually professionally developed, tested, and maintained to high standards. It is available for purchase, often with accompanying updates and consulting support.

  • The following are web-based software repositories with significant holdings in the area of special functions. …
    15: 7.22 Methods of Computation
    §7.22(i) Main Functions
    The methods available for computing the main functions in this chapter are analogous to those described in §§6.18(i)6.18(iv) for the exponential integral and sine and cosine integrals, and similar comments apply. …
    §7.22(ii) Goodwin–Staton Integral
    §7.22(iii) Repeated Integrals of the Complementary Error Function
    The recursion scheme given by (7.18.1) and (7.18.7) can be used for computing i n erfc ( x ) . …
    16: 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.

  • §8.26(iv) Generalized Exponential Integral
  • 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.

  • 17: 6.19 Tables
    §6.19(ii) Real Variables
  • Abramowitz and Stegun (1964, Chapter 5) includes x 1 Si ( x ) , x 2 Cin ( x ) , x 1 Ein ( x ) , x 1 Ein ( x ) , x = 0 ( .01 ) 0.5 ; Si ( x ) , Ci ( x ) , Ei ( x ) , E 1 ( x ) , x = 0.5 ( .01 ) 2 ; Si ( x ) , Ci ( x ) , x e x Ei ( x ) , x e x E 1 ( x ) , x = 2 ( .1 ) 10 ; x f ( x ) , x 2 g ( x ) , x e x Ei ( x ) , x e x E 1 ( x ) , x 1 = 0 ( .005 ) 0.1 ; Si ( π x ) , Cin ( π x ) , x = 0 ( .1 ) 10 . Accuracy varies but is within the range 8S–11S.

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

  • 18: 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. 321–322) covers Ein ( x ) and Ein ( x ) for 0 x 8 (the Chebyshev coefficients are given to 20D); E 1 ( x ) for x 5 (20D), and Ei ( x ) for x 8 (15D). Coefficients for the sine and cosine integrals are given on pp. 325–327.

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

  • 19: 36 Integrals with Coalescing Saddles
    Chapter 36 Integrals with Coalescing Saddles
    20: Bibliography G
  • W. Gautschi (1977a) Evaluation of the repeated integrals of the coerror function. ACM Trans. Math. Software 3, pp. 240–252.
  • W. Gautschi (1977b) Algorithm 521: Repeated integrals of the coerror function. ACM Trans. Math. Software 3, pp. 301–302.
  • W. Gautschi (1961) Recursive computation of the repeated integrals of the error function. Math. Comp. 15 (75), pp. 227–232.
  • W. Gautschi (2016) Algorithm 957: evaluation of the repeated integral of the coerror function by half-range Gauss-Hermite quadrature. ACM Trans. Math. Softw. 42 (1), pp. 9:1–9:10.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.