About the Project

Remez second algorithm

AdvancedHelp

(0.001 seconds)

11—20 of 372 matching pages

11: 35.12 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. … For an algorithm to evaluate zonal polynomials, and an implementation of the algorithm in Maple by Zeilberger, see Lapointe and Vinet (1996).
12: Bibliography K
  • E. H. Kaufman and T. D. Lenker (1986) Linear convergence and the bisection algorithm. Amer. Math. Monthly 93 (1), pp. 48–51.
  • 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.
  • K. S. Kölbig (1968) Algorithm 327: Dilogarithm [S22]. Comm. ACM 11 (4), pp. 270–271.
  • J. J. Kovacic (1986) An algorithm for solving second order linear homogeneous differential equations. J. Symbolic Comput. 2 (1), pp. 3–43.
  • H. Kuki (1972) Algorithm 421. Complex gamma function with error control. Comm. ACM 15 (4), pp. 271–272.
  • 13: Bibliography E
  • U. Eckhardt (1980) Algorithm 549: Weierstrass’ elliptic functions. ACM Trans. Math. Software 6 (1), pp. 112–120.
  • Á. Elbert and A. Laforgia (2008) The zeros of the complementary error function. Numer. Algorithms 49 (1-4), pp. 153–157.
  • A. Erdélyi (1942b) The Fuchsian equation of second order with four singularities. Duke Math. J. 9 (1), pp. 48–58.
  • D. Erricolo and G. Carluccio (2013) Algorithm 934: Fortran 90 subroutines to compute Mathieu functions for complex values of the parameter. ACM Trans. Math. Softw. 40 (1), pp. 8:1–8:19.
  • D. Erricolo (2006) Algorithm 861: Fortran 90 subroutines for computing the expansion coefficients of Mathieu functions using Blanch’s algorithm. ACM Trans. Math. Software 32 (4), pp. 622–634.
  • 14: Bibliography C
  • P. J. Cameron (1994) Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge.
  • S. M. Candel (1981) An algorithm for the Fourier-Bessel transform. Comput. Phys. Comm. 23 (4), pp. 343–353.
  • B. C. Carlson and E. M. Notis (1981) Algorithm 577: Algorithm for incomplete elliptic intergrals [S21]. ACM Trans. Math. Software 7 (3), pp. 398–403.
  • B. C. Carlson (1972a) An algorithm for computing logarithms and arctangents. Math. Comp. 26 (118), pp. 543–549.
  • J. E. Cremona (1997) Algorithms for Modular Elliptic Curves. 2nd edition, Cambridge University Press, Cambridge.
  • 15: 14.34 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. …
    16: Bibliography N
  • M. Nardin, W. F. Perger, and A. Bhalla (1992a) Algorithm 707: CONHYP: A numerical evaluator of the confluent hypergeometric function for complex arguments of large magnitudes. ACM Trans. Math. Software 18 (3), pp. 345–349.
  • J. J. Nestor (1984) Uniform Asymptotic Approximations of Solutions of Second-order Linear Differential Equations, with a Coalescing Simple Turning Point and Simple Pole. Ph.D. Thesis, University of Maryland, College Park, MD.
  • E. Neuman (1969a) Elliptic integrals of the second and third kinds. Zastos. Mat. 11, pp. 99–102.
  • E. Neuman (1969b) On the calculation of elliptic integrals of the second and third kinds. Zastos. Mat. 11, pp. 91–94.
  • A. Nijenhuis and H. S. Wilf (1975) Combinatorial Algorithms. Academic Press, New York.
  • 17: 29.20 Methods of Computation
    A second approach is to solve the continued-fraction equations typified by (29.3.10) by Newton’s rule or other iterative methods; see §3.8. …The Fourier series may be summed using Clenshaw’s algorithm; see §3.11(ii). …
    18: Bibliography S
  • B. E. Sagan (2001) The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions. 2nd edition, Graduate Texts in Mathematics, Vol. 203, Springer-Verlag, New York.
  • B. L. Shea (1988) Algorithm AS 239. Chi-squared and incomplete gamma integral. Appl. Statist. 37 (3), pp. 466–473.
  • G. W. Stewart (2001) Matrix Algorithms. Vol. 2: Eigensystems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • A. N. Stokes (1980) A stable quotient-difference algorithm. Math. Comp. 34 (150), pp. 515–519.
  • Stony Brook Algorithm Repository (website) Department of Computer Science, Stony Brook University, New York.
  • 19: Bibliography L
  • W. R. Leeb (1979) Algorithm 537: Characteristic values of Mathieu’s differential equation. ACM Trans. Math. Software 5 (1), pp. 112–117.
  • D. A. Levine (1969) Algorithm 344: Student’s t-distribution [S14]. Comm. ACM 12 (1), pp. 37–38.
  • H. Lotsch and M. Gray (1964) Algorithm 244: Fresnel integrals. Comm. ACM 7 (11), pp. 660–661.
  • Y. L. Luke (1977a) Algorithms for rational approximations for a confluent hypergeometric function. Utilitas Math. 11, pp. 123–151.
  • Y. L. Luke (1977b) Algorithms for the Computation of Mathematical Functions. Academic Press, New York.
  • 20: Bibliography
  • R. W. Abernathy and R. P. Smith (1993) Algorithm 724: Program to calculate F-percentiles. ACM Trans. Math. Software 19 (4), pp. 481–483.
  • A. G. Adams (1969) Algorithm 39: Areas under the normal curve. The Computer Journal 12 (2), pp. 197–198.
  • D. W. Albrecht, E. L. Mansfield, and A. E. Milne (1996) Algorithms for special integrals of ordinary differential equations. J. Phys. A 29 (5), pp. 973–991.
  • F. A. Alhargan (2000) Algorithm 804: Subroutines for the computation of Mathieu functions of integer orders. ACM Trans. Math. Software 26 (3), pp. 408–414.
  • D. E. Amos (1983b) Algorithm 610. A portable FORTRAN subroutine for derivatives of the psi function. ACM Trans. Math. Software 9 (4), pp. 494–502.