About the Project

Olver%20algorithm

AdvancedHelp

(0.002 seconds)

10 matching pages

1: Bibliography S
β–Ί
  • A. Sharples (1967) Uniform asymptotic forms of modified Mathieu functions. Quart. J. Mech. Appl. Math. 20 (3), pp. 365–380.
  • β–Ί
  • 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.
  • 2: Bibliography O
    β–Ί
  • F. W. J. Olver and D. J. Sookne (1972) Note on backward recurrence algorithms. Math. Comp. 26 (120), pp. 941–947.
  • β–Ί
  • F. W. J. Olver (1964a) Error analysis of Miller’s recurrence algorithm. Math. Comp. 18 (85), pp. 65–74.
  • β–Ί
  • F. W. J. Olver (1970) A paradox in asymptotics. SIAM J. Math. Anal. 1 (4), pp. 533–534.
  • β–Ί
  • F. W. J. Olver (1974) Error bounds for stationary phase approximations. SIAM J. Math. Anal. 5 (1), pp. 19–29.
  • β–Ί
  • F. W. J. Olver (1977c) Second-order differential equations with fractional transition points. Trans. Amer. Math. Soc. 226, pp. 227–241.
  • 3: 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.
  • β–Ί
  • S. V. Aksenov, M. A. Savageau, U. D. Jentschura, J. Becher, G. Soff, and P. J. Mohr (2003) Application of the combined nonlinear-condensation transformation to problems in statistical analysis and theoretical physics. Comput. Phys. Comm. 150 (1), pp. 1–20.
  • β–Ί
  • 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.
  • 4: Bibliography F
    β–Ί
  • B. R. Fabijonas, D. W. Lozier, and J. M. Rappoport (2003) Algorithms and codes for the Macdonald function: Recent progress and comparisons. J. Comput. Appl. Math. 161 (1), pp. 179–192.
  • β–Ί
  • B. R. Fabijonas (2004) Algorithm 838: Airy functions. ACM Trans. Math. Software 30 (4), pp. 491–501.
  • β–Ί
  • S. Fempl (1960) Sur certaines sommes des intégral-cosinus. Bull. Soc. Math. Phys. Serbie 12, pp. 13–20 (French).
  • β–Ί
  • A. M. S. Filho and G. Schwachheim (1967) Algorithm 309. Gamma function with arbitrary precision. Comm. ACM 10 (8), pp. 511–512.
  • β–Ί
  • L. W. Fullerton (1972) Algorithm 435: Modified incomplete gamma function. Comm. ACM 15 (11), pp. 993–995.
  • 5: Bibliography B
    β–Ί
  • G. Backenstoss (1970) Pionic atoms. Annual Review of Nuclear and Particle Science 20, pp. 467–508.
  • β–Ί
  • 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.
  • β–Ί
  • K. L. Bell and N. S. Scott (1980) Coulomb functions (negative energies). Comput. Phys. Comm. 20 (3), pp. 447–458.
  • β–Ί
  • W. G. Bickley (1935) Some solutions of the problem of forced convection. Philos. Mag. Series 7 20, pp. 322–343.
  • 6: 2.11 Remainder Terms; Stokes Phenomenon
    β–ΊFurther details for this example are supplied in Olver (1991a, 1994b). … β–ΊFor further details see Olde Daalhuis and Olver (1994). … β–ΊFor second-order differential equations, see Olde Daalhuis and Olver (1995a), Olde Daalhuis (1995, 1996), and Murphy and Wood (1997). … β–ΊSimilar improvements are achievable by Aitken’s Ξ” 2 -process, Wynn’s Ο΅ -algorithm, and other acceleration transformations. … β–ΊFor example, using double precision d 20 is found to agree with (2.11.31) to 13D. …
    7: Bibliography K
    β–Ί
  • E. H. Kaufman and T. D. Lenker (1986) Linear convergence and the bisection algorithm. Amer. Math. Monthly 93 (1), pp. 48–51.
  • β–Ί
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • β–Ί
  • R. B. Kearfott (1996) Algorithm 763: INTERVAL_ARITHMETIC: A Fortran 90 module for an interval data type. ACM Trans. Math. Software 22 (4), pp. 385–392.
  • β–Ί
  • K. S. Kölbig (1968) Algorithm 327: Dilogarithm [S22]. Comm. ACM 11 (4), pp. 270–271.
  • β–Ί
  • H. Kuki (1972) Algorithm 421. Complex gamma function with error control. Comm. ACM 15 (4), pp. 271–272.
  • 8: Bibliography L
    β–Ί
  • P. W. Lawrence, R. M. Corless, and D. J. Jeffrey (2012) Algorithm 917: complex double-precision evaluation of the Wright Ο‰ function. ACM Trans. Math. Software 38 (3), pp. Art. 20, 17.
  • β–Ί
  • D. J. Leeming (1977) An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.
  • β–Ί
  • 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.
  • 9: 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.
  • 10: Bibliography W
    β–Ί
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • β–Ί
  • 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.
  • β–Ί
  • 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.