About the Project

bisection%20method

AdvancedHelp

(0.002 seconds)

11—20 of 223 matching pages

11: 12.18 Methods of Computation
§12.18 Methods of Computation
Because PCFs are special cases of confluent hypergeometric functions, the methods of computation described in §13.29 are applicable to PCFs. …
12: Bibliography O
  • A. M. Odlyzko (1995) Asymptotic Enumeration Methods. In Handbook of Combinatorics, Vol. 2, L. Lovász, R. L. Graham, and M. Grötschel (Eds.), pp. 1063–1229.
  • T. Oliveira e Silva (2006) Computing π ( x ) : The combinatorial method. Revista do DETUA 4 (6), pp. 759–768.
  • J. Oliver (1977) An error analysis of the modified Clenshaw method for evaluating Chebyshev and Fourier series. J. Inst. Math. Appl. 20 (3), pp. 379–391.
  • F. W. J. Olver (1950) A new method for the evaluation of zeros of Bessel functions and of other solutions of second-order differential equations. Proc. Cambridge Philos. Soc. 46 (4), pp. 570–580.
  • F. W. J. Olver (1951) A further method for the evaluation of zeros of Bessel functions and some new asymptotic expansions for zeros of functions of large order. Proc. Cambridge Philos. Soc. 47, pp. 699–712.
  • 13: Bibliography R
  • M. Reed and B. Simon (1975) Methods of Modern Mathematical Physics, Vol. 2, Fourier Analysis, Self-Adjointness. Academic Press, New York.
  • M. Reed and B. Simon (1978) Methods of Modern Mathematical Physics, Vol. 4, Analysis of Operators. Academic Press, New York.
  • M. Reed and B. Simon (1979) Methods of Modern Mathematical Physics, Vol. 3, Scattering Theory. Academic Press, New York.
  • M. Reed and B. Simon (1980) Methods of Modern Mathematical Physics, Vol. 1, Functional Analysis. Elsevier, New York.
  • E. Ya. Remez (1957) General Computation Methods of Chebyshev Approximation. The Problems with Linear Real Parameters. Publishing House of the Academy of Science of the Ukrainian SSR, Kiev.
  • 14: 34.13 Methods of Computation
    §34.13 Methods of Computation
    Methods of computation for 3 j and 6 j symbols include recursion relations, see Schulten and Gordon (1975a), Luscombe and Luban (1998), and Edmonds (1974, pp. 42–45, 48–51, 97–99); summation of single-sum expressions for these symbols, see Varshalovich et al. (1988, §§8.2.6, 9.2.1) and Fang and Shriner (1992); evaluation of the generalized hypergeometric functions of unit argument that represent these symbols, see Srinivasa Rao and Venkatesh (1978) and Srinivasa Rao (1981). For 9 j symbols, methods include evaluation of the single-sum series (34.6.2), see Fang and Shriner (1992); evaluation of triple-sum series, see Varshalovich et al. (1988, §10.2.1) and Srinivasa Rao et al. (1989). A review of methods of computation is given in Srinivasa Rao and Rajeswari (1993, Chapter VII, pp. 235–265). …
    15: 16.25 Methods of Computation
    §16.25 Methods of Computation
    Methods for computing the functions of the present chapter include power series, asymptotic expansions, integral representations, differential equations, and recurrence relations. …
    16: 32.17 Methods of Computation
    §32.17 Methods of Computation
    The Painlevé equations can be integrated by Runge–Kutta methods for ordinary differential equations; see §3.7(v), Hairer et al. (2000), and Butcher (2003). …
    17: Bibliography G
  • B. Gabutti (1979) On high precision methods for computing integrals involving Bessel functions. Math. Comp. 33 (147), pp. 1049–1057.
  • B. Gabutti (1980) On the generalization of a method for computing Bessel function integrals. J. Comput. Appl. Math. 6 (2), pp. 167–168.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • M. L. Glasser (1979) A method for evaluating certain Bessel integrals. Z. Angew. Math. Phys. 30 (4), pp. 722–723.
  • B. Guo (1998) Spectral Methods and Their Applications. World Scientific Publishing Co. Inc., River Edge, NJ-Singapore.
  • 18: 19.36 Methods of Computation
    §19.36 Methods of Computation
    §19.36(i) Duplication Method
    For computation of Legendre’s integral of the third kind, see Abramowitz and Stegun (1964, §§17.7 and 17.8, Examples 15, 17, 19, and 20). …
    §19.36(iv) Other Methods
    Numerical quadrature is slower than most methods for the standard integrals but can be useful for elliptic integrals that have complicated representations in terms of standard integrals. …
    19: 29.20 Methods of Computation
    §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. … A third method is to approximate eigenvalues and Fourier coefficients of Lamé functions by eigenvalues and eigenvectors of finite matrices using the methods of §§3.2(vi) and 3.8(iv). …The numerical computations described in Jansen (1977) are based in part upon this method. A fourth method is by asymptotic approximations by zeros of orthogonal polynomials of increasing degree. …
    20: Bibliography B
  • G. Backenstoss (1970) Pionic atoms. Annual Review of Nuclear and Particle Science 20, pp. 467–508.
  • K. L. Bell and N. S. Scott (1980) Coulomb functions (negative energies). Comput. Phys. Comm. 20 (3), pp. 447–458.
  • E. A. Bender (1974) Asymptotic methods in enumeration. SIAM Rev. 16 (4), pp. 485–515.
  • W. G. Bickley (1935) Some solutions of the problem of forced convection. Philos. Mag. Series 7 20, pp. 322–343.
  • Å. Björck (1996) Numerical Methods for Least Squares Problems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.