About the Project

summability%20methods

AdvancedHelp

(0.002 seconds)

11—20 of 224 matching pages

11: 17.18 Methods of Computation
§17.18 Methods of Computation
Method (2) is very powerful when applicable (Andrews (1976, Chapter 5)); however, it is applicable only rarely. Lehner (1941) uses Method (2) in connection with the Rogers–Ramanujan identities. Method (1) can sometimes be improved by application of convergence acceleration procedures; see §3.9. Shanks (1955) applies such methods in several q -series problems; see Andrews et al. (1986).
12: 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. …
13: Bibliography N
  • National Physical Laboratory (1961) Modern Computing Methods. 2nd edition, Notes on Applied Science, No. 16, Her Majesty’s Stationery Office, London.
  • D. Naylor (1989) On an integral transform involving a class of Mathieu functions. SIAM J. Math. Anal. 20 (6), pp. 1500–1513.
  • W. J. Nellis and B. C. Carlson (1966) Reduction and evaluation of elliptic integrals. Math. Comp. 20 (94), pp. 223–231.
  • G. Nemes (2013a) An explicit formula for the coefficients in Laplace’s method. Constr. Approx. 38 (3), pp. 471–487.
  • G. Nemes (2020) An extension of Laplace’s method. Constr. Approx. 51 (2), pp. 247–272.
  • 14: Bibliography K
  • D. K. Kahaner, C. Moler, and S. Nash (1989) Numerical Methods and Software. Prentice Hall, Englewood Cliffs, N.J..
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • M. K. Kerimov (1999) The Rayleigh function: Theory and computational methods. Zh. Vychisl. Mat. Mat. Fiz. 39 (12), pp. 1962–2006.
  • A. D. Kerr (1978) An indirect method for evaluating certain infinite integrals. Z. Angew. Math. Phys. 29 (3), pp. 380–386.
  • S. Kesavan and A. S. Vasudevamurthy (1985) On some boundary element methods for the heat equation. Numer. Math. 46 (1), pp. 101–120.
  • 15: 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.
  • 16: 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.
  • 17: 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). …
    18: 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. …
    19: 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). …
    20: 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.