About the Project

computer arithmetic

AdvancedHelp

(0.002 seconds)

11—20 of 29 matching pages

11: 27.17 Other Applications
Reed et al. (1990, pp. 458–470) describes a number-theoretic approach to Fourier analysis (called the arithmetic Fourier transform) that uses the Möbius inversion (27.5.7) to increase efficiency in computing coefficients of Fourier series. …
12: 4.48 Software
All scientific programming languages, libraries, and systems support computation of at least some of the elementary functions in standard floating-point arithmetic3.1(i)). … A more complete list of available software for computing these functions is found in the Software Index; again, software that uses only standard floating-point arithmetic is excluded. …
13: Bibliography Y
  • A. Yu. Yeremin, I. E. Kaporin, and M. K. Kerimov (1985) The calculation of the Riemann zeta function in the complex domain. USSR Comput. Math. and Math. Phys. 25 (2), pp. 111–119.
  • A. Yu. Yeremin, I. E. Kaporin, and M. K. Kerimov (1988) Computation of the derivatives of the Riemann zeta-function in the complex domain. USSR Comput. Math. and Math. Phys. 28 (4), pp. 115–124.
  • J. M. Yohe (1979) Software for interval arithmetic: A reasonably portable package. ACM Trans. Math. Software 5 (1), pp. 50–63.
  • T. Yoshida (1995) Computation of Kummer functions U ( a , b , x ) for large argument x by using the τ -method. Trans. Inform. Process. Soc. Japan 36 (10), pp. 2335–2342 (Japanese).
  • 14: 3.6 Linear Difference Equations
    Difference equations are simple and attractive for computation. … Unless exact arithmetic is being used, however, each step of the calculation introduces rounding errors. …
    Example 1. Bessel Functions
    Example 2. Weber Function
    The results of the computations are displayed in Table 3.6.1. …
    15: 15.19 Methods of Computation
    §15.19 Methods of Computation
    For fast computation of F ( a , b ; c ; z ) with a , b and c complex, and with application to Pöschl–Teller–Ginocchio potential wave functions, see Michel and Stoitsov (2008). … The representation (15.6.1) can be used to compute the hypergeometric function in the sector | ph ( 1 z ) | < π . … The relations in §15.5(ii) can be used to compute F ( a , b ; c ; z ) , provided that care is taken to apply these relations in a stable manner; see §3.6(ii). … The accuracy is controlled and validated by a running error analysis coupled with interval arithmetic.
    16: 33.23 Methods of Computation
    §33.23 Methods of Computation
    The methods used for computing the Coulomb functions described below are similar to those in §13.29. … The power-series expansions of §§33.6 and 33.19 converge for all finite values of the radii ρ and r , respectively, and may be used to compute the regular and irregular solutions. …Use of extended-precision arithmetic increases the radial range that yields accurate results, but eventually other methods must be employed, for example, the asymptotic expansions of §§33.11 and 33.21. … Thus the regular solutions can be computed from the power-series expansions (§§33.6, 33.19) for small values of the radii and then integrated in the direction of increasing values of the radii. …
    17: 13.29 Methods of Computation
    §13.29 Methods of Computation
    The integral representations (13.4.1) and (13.4.4) can be used to compute the Kummer functions, and (13.16.1) and (13.16.5) for the Whittaker functions. In Allasia and Besenghi (1991) and Allasia and Besenghi (1987a) the high accuracy of the trapezoidal rule for the computation of Kummer functions is described. … The recurrence relations in §§13.3(i) and 13.15(i) can be used to compute the confluent hypergeometric functions in an efficient way. … The accuracy is controlled and validated by a running error analysis coupled with interval arithmetic.
    18: Bibliography B
  • J. S. Ball (2000) Automatic computation of zeros of Bessel functions and other special functions. SIAM J. Sci. Comput. 21 (4), pp. 1458–1464.
  • A. Bañuelos, R. A. Depine, and R. C. Mancini (1981) A program for computing the Fermi-Dirac functions. Comput. Phys. Comm. 21 (3), pp. 315–322.
  • K. O. Bowman (1984) Computation of the polygamma functions. Comm. Statist. B—Simulation Comput. 13 (3), pp. 409–415.
  • R. P. Brent (1978a) A Fortran multiple-precision arithmetic package. ACM Trans. Math. Software 4 (1), pp. 57–70.
  • R. P. Brent (1978b) Algorithm 524: MP, A Fortran multiple-precision arithmetic package [A1]. ACM Trans. Math. Software 4 (1), pp. 71–81.
  • 19: Bibliography C
  • B. C. Carlson (1965) On computing elliptic integrals and functions. J. Math. and Phys. 44, pp. 36–51.
  • B. C. Carlson (1972a) An algorithm for computing logarithms and arctangents. Math. Comp. 26 (118), pp. 543–549.
  • C. W. Clenshaw, F. W. J. Olver, and P. R. Turner (1989) Level-Index Arithmetic: An Introductory Survey. In Numerical Analysis and Parallel Processing (Lancaster, 1987), P. R. Turner (Ed.), Lecture Notes in Math., Vol. 1397, pp. 95–168.
  • D. A. Cox (1984) The arithmetic-geometric mean of Gauss. Enseign. Math. (2) 30 (3-4), pp. 275–330.
  • D. A. Cox (1985) Gauss and the arithmetic-geometric mean. Notices Amer. Math. Soc. 32 (2), pp. 147–151.
  • 20: Bibliography K
  • C. Kormanyos (2011) Algorithm 910: a portable C++ multiple-precision system for special-function calculations. ACM Trans. Math. Software 37 (4), pp. Art. 45, 27.