About the Project

relative precision

AdvancedHelp

(0.001 seconds)

1—10 of 14 matching pages

1: 7.24 Approximations
  • Cody (1969) provides minimax rational approximations for erf x and erfc x . The maximum relative precision is about 20S.

  • Cody (1968) gives minimax rational approximations for the Fresnel integrals (maximum relative precision 19S); for a Fortran algorithm and comments see Snyder (1993).

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

  • 2: 3.1 Arithmetics and Error Measures
    Symmetric rounding or rounding to nearest of x gives x or x + , whichever is nearer to x , with maximum relative error equal to the machine precision 1 2 ϵ M = 2 p . … Also in this arithmetic generalized precision can be defined, which includes absolute error and relative precision3.1(v)) as special cases. … The relative precision is
    3.1.10 ϵ 𝑟𝑝 = | ln ( x / x ) | ,
    3: 19.15 Advantages of Symmetry
    Symmetry allows the expansion (19.19.7) in a series of elementary symmetric functions that gives high precision with relatively few terms and provides the most efficient method of computing the incomplete integral of the third kind (§19.36(i)). …
    4: 3.10 Continued Fractions
    The recurrences are continued until ( C n ) / C n is within a prescribed relative precision. …
    5: 27.17 Other Applications
    Schroeder (2006) describes many of these applications, including the design of concert hall ceilings to scatter sound into broad lateral patterns for improved acoustic quality, precise measurements of delays of radar echoes from Venus and Mercury to confirm one of the relativistic effects predicted by Einstein’s theory of general relativity, and the use of primes in creating artistic graphical designs.
    6: Bibliography Z
  • M. R. Zaghloul (2016) Remark on “Algorithm 916: computing the Faddeyeva and Voigt functions”: efficiency improvements and Fortran translation. ACM Trans. Math. Softw. 42 (3), pp. 26:1–26:9.
  • M. R. Zaghloul (2017) Algorithm 985: Simple, Efficient, and Relatively Accurate Approximation for the Evaluation of the Faddeyeva Function. ACM Trans. Math. Softw. 44 (2), pp. 22:1–22:9.
  • S. Zhang and J. Jin (1996) Computation of Special Functions. John Wiley & Sons Inc., New York.
  • 7: DLMF Project News
    error generating summary
    8: 25.20 Approximations
  • Cody et al. (1971) gives rational approximations for ζ ( s ) in the form of quotients of polynomials or quotients of Chebyshev series. The ranges covered are 0.5 s 5 , 5 s 11 , 11 s 25 , 25 s 55 . Precision is varied, with a maximum of 20S.

  • Morris (1979) gives rational approximations for Li 2 ( x ) 25.12(i)) for 0.5 x 1 . Precision is varied with a maximum of 24S.

  • Antia (1993) gives minimax rational approximations for Γ ( s + 1 ) F s ( x ) , where F s ( x ) is the Fermi–Dirac integral (25.12.14), for the intervals < x 2 and 2 x < , with s = 1 2 , 1 2 , 3 2 , 5 2 . For each s there are three sets of approximations, with relative maximum errors 10 4 , 10 8 , 10 12 .

  • 9: Bibliography G
  • B. Gabutti (1979) On high precision methods for computing integrals involving Bessel functions. Math. Comp. 33 (147), pp. 1049–1057.
  • W. Gautschi (1964a) Algorithm 222: Incomplete beta function ratios. Comm. ACM 7 (3), pp. 143–144.
  • W. Gautschi (1979a) Algorithm 542: Incomplete gamma functions. ACM Trans. Math. Software 5 (4), pp. 482–489.
  • W. Gautschi (2009) Variable-precision recurrence coefficients for nonstandard orthogonal polynomials. Numer. Algorithms 52 (3), pp. 409–418.
  • K. Girstmair (1990b) Dirichlet convolution of cotangent numbers and relative class number formulas. Monatsh. Math. 110 (3-4), pp. 231–256.
  • 10: Bibliography S
  • T. C. Scott, R. Mann, and R. E. Martinez (2006) General relativity and quantum mechanics: towards a generalization of the Lambert W function: a generalization of the Lambert W function. Appl. Algebra Engrg. Comm. Comput. 17 (1), pp. 41–47.
  • D. M. Smith (1989) Efficient multiple-precision evaluation of elementary functions. Math. Comp. 52 (185), pp. 131–134.
  • D. M. Smith (1991) Algorithm 693: A FORTRAN package for floating-point multiple-precision arithmetic. ACM Trans. Math. Software 17 (2), pp. 273–283.
  • O. Szász (1950) On the relative extrema of ultraspherical polynomials. Boll. Un. Mat. Ital. (3) 5, pp. 125–127.
  • O. Szász (1951) On the relative extrema of the Hermite orthogonal functions. J. Indian Math. Soc. (N.S.) 15, pp. 129–134.