About the Project

Remez second algorithm

AdvancedHelp

(0.001 seconds)

21—30 of 372 matching pages

21: Bibliography H
  • E. W. Hansen (1985) Fast Hankel transform algorithm. IEEE Trans. Acoust. Speech Signal Process. 32 (3), pp. 666–671.
  • J. R. Herndon (1961a) Algorithm 55: Complete elliptic integral of the first kind. Comm. ACM 4 (4), pp. 180.
  • J. R. Herndon (1961b) Algorithm 56: Complete elliptic integral of the second kind. Comm. ACM 4 (4), pp. 180–181.
  • G. W. Hill and A. W. Davis (1973) Algorithm 442: Normal deviate. Comm. ACM 16 (1), pp. 51–52.
  • I. D. Hill (1973) Algorithm AS66: The normal integral. Appl. Statist. 22 (3), pp. 424–427.
  • 22: Bibliography P
  • K. A. Paciorek (1970) Algorithm 385: Exponential integral Ei ( x ) . Comm. ACM 13 (7), pp. 446–447.
  • P. Painlevé (1906) Sur les équations différentielles du second ordre à points critiques fixès. C.R. Acad. Sc. Paris 143, pp. 1111–1117.
  • R. Piessens and M. Branders (1984) Algorithm 28. Algorithm for the computation of Bessel function integrals. J. Comput. Appl. Math. 11 (1), pp. 119–137.
  • G. P. M. Poppe and C. M. J. Wijers (1990) Algorithm 680: Evaluation of the complex error function. ACM Trans. Math. Software 16 (1), pp. 47.
  • P. J. Prince (1975) Algorithm 498: Airy functions using Chebyshev series approximations. ACM Trans. Math. Software 1 (4), pp. 372–379.
  • 23: Bibliography M
  • A. J. MacLeod (1989) Algorithm AS 245. A robust and reliable algorithm for the logarithm of the gamma function. Appl. Statist. 38 (2), pp. 397–402.
  • K. L. Majumder and G. P. Bhattacharjee (1973) Algorithm AS 63. The incomplete beta integral. Appl. Statist. 22 (3), pp. 409–411.
  • J. N. Merner (1962) Algorithm 149: Complete elliptic integral. Comm. ACM 5 (12), pp. 605.
  • R. J. Moore (1982) Algorithm AS 187. Derivatives of the incomplete gamma integral. Appl. Statist. 31 (3), pp. 330–335.
  • J. Muller (1997) Elementary Functions: Algorithms and Implementation. Birkhäuser Boston Inc., Boston, MA.
  • 24: Bibliography W
  • T. Weider (1999) Algorithm 794: Numerical Hankel transform by the Fortran program HANKEL. ACM Trans. Math. Software 25 (2), pp. 240–250.
  • E. J. Weniger (2003) A rational approximant for the digamma function. Numer. Algorithms 33 (1-4), pp. 499–507.
  • E. J. Weniger (2007) Asymptotic Approximations to Truncation Errors of Series Representations for Special Functions. In Algorithms for Approximation, A. Iske and J. Levesley (Eds.), pp. 331–348.
  • H. S. Wilf and D. Zeilberger (1992a) An algorithmic proof theory for hypergeometric (ordinary and “ q ”) multisum/integral identities. Invent. Math. 108, pp. 575–633.
  • M. E. Wojcicki (1961) Algorithm 44: Bessel functions computed recursively. Comm. ACM 4 (4), pp. 177–178.
  • 25: 9.17 Methods of Computation
    The second method is to apply generalized Gauss–Laguerre quadrature (§3.5(v)) to the integral (9.5.8). For the second method see also Gautschi (2002a). … In consequence of §9.6(i), algorithms for generating Bessel functions, Hankel functions, and modified Bessel functions (§10.74) can also be applied to Ai ( z ) , Bi ( z ) , and their derivatives. …
    26: 17.19 Software
    In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …
    27: 26.22 Software
    In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …
  • Stony Brook Algorithm Repository (website).

  • For algorithms for counting and analyzing combinatorial structures see Knuth (1993), Nijenhuis and Wilf (1975), and Stanton and White (1986).
    28: 27.18 Methods of Computation: Primes
    Two simple algorithms for proving primality require a knowledge of all or part of the factorization of n 1 , n + 1 , or both; see Crandall and Pomerance (2005, §§4.1–4.2). These algorithms are used for testing primality of Mersenne numbers, 2 n 1 , and Fermat numbers, 2 2 n + 1 . … The APR (Adleman–Pomerance–Rumely) algorithm for primality testing is based on Jacobi sums. … The AKS (Agrawal–Kayal–Saxena) algorithm is the first deterministic, polynomial-time, primality test. … The ECPP (Elliptic Curve Primality Proving) algorithm handles primes with over 20,000 digits. …
    29: Bibliography B
  • D. H. Bailey (1993) Algorithm 719: Multiprecision translation and execution of Fortran programs. ACM Trans. Math. Software 19 (3), pp. 288–319.
  • A. R. Barnett (1981a) An algorithm for regular and irregular Coulomb and Bessel functions of real order to machine accuracy. Comput. Phys. Comm. 21 (3), pp. 297–314.
  • A. R. Booker, A. Strömbergsson, and H. Then (2013) Bounds and algorithms for the K -Bessel function of imaginary order. LMS J. Comput. Math. 16, pp. 78–108.
  • W. Börsch-Supan (1960) Algorithm 21: Bessel function for a set of integer orders. Comm. ACM 3 (11), pp. 600.
  • R. P. Brent (1978b) Algorithm 524: MP, A Fortran multiple-precision arithmetic package [A1]. ACM Trans. Math. Software 4 (1), pp. 71–81.
  • 30: Bibliography D
  • B. Deconinck, M. Heil, A. Bobenko, M. van Hoeij, and M. Schmies (2004) Computing Riemann theta functions. Math. Comp. 73 (247), pp. 1417–1442.
  • A. R. DiDonato and A. H. Morris (1987) Algorithm 654: Fortran subroutines for computing the incomplete gamma function ratios and their inverses. ACM Trans. Math. Software 13 (3), pp. 318–319.
  • A. R. DiDonato and A. H. Morris (1992) Algorithm 708: Significant digit computation of the incomplete beta function ratios. ACM Trans. Math. Software 18 (3), pp. 360–373.
  • D. Ding (2000) A simplified algorithm for the second-order sound fields. J. Acoust. Soc. Amer. 108 (6), pp. 2759–2764.
  • E. Dorrer (1968) Algorithm 322. F-distribution. Comm. ACM 11 (2), pp. 116–117.