Leibniz%20formula
(0.001 seconds)
21—30 of 308 matching pages
21: Bibliography O
…
►
Fourier Expansions. A Collection of Formulas.
Academic Press, New York-London.
…
►
An error analysis of the modified Clenshaw method for evaluating Chebyshev and Fourier series.
J. Inst. Math. Appl. 20 (3), pp. 379–391.
…
►
Connection formulas for second-order differential equations with multiple turning points.
SIAM J. Math. Anal. 8 (1), pp. 127–154.
►
Connection formulas for second-order differential equations having an arbitrary number of turning points of arbitrary multiplicities.
SIAM J. Math. Anal. 8 (4), pp. 673–700.
…
►
General connection formulae for Liouville-Green approximations in the complex plane.
Philos. Trans. Roy. Soc. London Ser. A 289, pp. 501–548.
…
22: 8 Incomplete Gamma and Related
Functions
…
23: 28 Mathieu Functions and Hill’s Equation
…
24: 25.6 Integer Arguments
25: Bibliography W
…
►
Reduction formulae for products of theta functions.
J. Res. Nat. Inst. Standards and Technology 117, pp. 297–303.
…
►
The Nahm equations, finite-gap potentials and Lamé functions.
J. Phys. A 20 (10), pp. 2679–2683.
…
►
Recursion formulae for hypergeometric functions.
Math. Comp. 22 (102), pp. 363–373.
…
►
Explicit formulas for the associated Jacobi polynomials and some applications.
Canad. J. Math. 39 (4), pp. 983–1000.
…
►
Quadrature formulas for oscillatory integral transforms.
Numer. Math. 39 (3), pp. 351–360.
…
26: 8.26 Tables
…
►
•
…
►
•
…
►
•
…
►
•
Khamis (1965) tabulates for , to 10D.
Abramowitz and Stegun (1964, pp. 245–248) tabulates for , to 7D; also for , to 6S.
Pagurova (1961) tabulates for , to 4-9S; for , to 7D; for , to 7S or 7D.
Zhang and Jin (1996, Table 19.1) tabulates for , to 7D or 8S.
27: 23 Weierstrass Elliptic and Modular
Functions
…
28: 27.20 Methods of Computation: Other Number-Theoretic Functions
…
►The recursion formulas (27.14.6) and (27.14.7) can be used to calculate the partition function for .
…
►A recursion formula obtained by differentiating (27.14.18) can be used to calculate Ramanujan’s function , and the values can be checked by the congruence (27.14.20).
…
29: Bibliography B
…
►
Pionic atoms.
Annual Review of Nuclear and Particle Science 20, pp. 467–508.
…
►
A program for computing the Riemann zeta function for complex argument.
Comput. Phys. Comm. 20 (3), pp. 441–445.
…
►
Mathieu functions of general order: Connection formulae, base functions and asymptotic formulae. I–V.
Philos. Trans. Roy. Soc. London Ser. A 301, pp. 75–162.
…
►
Coulomb functions (negative energies).
Comput. Phys. Comm. 20 (3), pp. 447–458.
…
►
Some solutions of the problem of forced convection.
Philos. Mag. Series 7 20, pp. 322–343.
…
30: Bibliography M
…
►
Rational approximations, software and test methods for sine and cosine integrals.
Numer. Algorithms 12 (3-4), pp. 259–272.
…
►
Calculation of the modified Bessel functions of the second kind with complex argument.
Math. Comp. 20 (95), pp. 407–412.
…
►
Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems.
Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
…
►
The -analogue of the Laguerre polynomials.
J. Math. Anal. Appl. 81 (1), pp. 20–47.
►
The -analogue of Stirling’s formula.
Rocky Mountain J. Math. 14 (2), pp. 403–413.
…