About the Project

Van Vleck theorem

AdvancedHelp

(0.001 seconds)

11—20 of 157 matching pages

11: 10.74 Methods of Computation
To ensure that no zeros are overlooked, standard tools are the phase principle and Rouché’s theorem; see §1.10(iv). … For infinite integrals involving products of Bessel functions of the first kind, see Linz and Kropp (1973), Gabutti (1980), Ikonomou et al. (1995), Lucas (1995), and Van Deun and Cools (2008). …
12: Bibliography K
  • E. L. Kaplan (1948) Auxiliary table for the incomplete elliptic integrals. J. Math. Physics 27, pp. 11–36.
  • T. Kasuga and R. Sakai (2003) Orthonormal polynomials with generalized Freud-type weights. J. Approx. Theory 121 (1), pp. 13–53.
  • B. J. King and A. L. Van Buren (1973) A general addition theorem for spheroidal wave functions. SIAM J. Math. Anal. 4 (1), pp. 149–160.
  • B. J. King and A. L. Van Buren (1970) A Fortran computer program for calculating the prolate and oblate angle functions of the first kind and their first and second derivatives. NRL Report No. 7161 Naval Res. Lab.  Washingtion, D.C..
  • T. H. Koornwinder (1975a) A new proof of a Paley-Wiener type theorem for the Jacobi transform. Ark. Mat. 13, pp. 145–159.
  • 13: 34.7 Basic Properties: 9 j Symbol
    For generating functions for the 9 j symbol see Biedenharn and van Dam (1965, p. 258, eq. (4.37)). … It constitutes an addition theorem for the 9 j symbol. …
    14: 30.18 Software
    See also King et al. (1970), King and Van Buren (1970), Van Buren et al. (1970), and Van Buren et al. (1972).
    15: 25.10 Zeros
    Also, ζ ( s ) 0 for s = 1 , a property first established in Hadamard (1896) and de la Vallée Poussin (1896a, b) in the proof of the prime number theorem (25.16.3). … Calculations based on the Riemann–Siegel formula reveal that the first ten billion zeros of ζ ( s ) in the critical strip are on the critical line (van de Lune et al. (1986)). …
    16: Bibliography G
  • J. S. Geronimo, O. Bruno, and W. Van Assche (2004) WKB and turning point theory for second-order difference equations. In Spectral Methods for Operators of Mathematical Physics, Oper. Theory Adv. Appl., Vol. 154, pp. 101–138.
  • K. Girstmair (1990a) A theorem on the numerators of the Bernoulli numbers. Amer. Math. Monthly 97 (2), pp. 136–138.
  • G. H. Golub and C. F. Van Loan (1996) Matrix Computations. 3rd edition, Johns Hopkins University Press, Baltimore, MD.
  • E. T. Goodwin and J. Staton (1948) Table of 0 e u 2 u + x 𝑑 u . Quart. J. Mech. Appl. Math. 1 (1), pp. 319–326.
  • F. W. Grover (1946) Inductance Calculations. Van Nostrand, New York.
  • 17: 5.21 Methods of Computation
    For a comprehensive survey see van der Laan and Temme (1984, Chapter III). …
    18: Tom H. Koornwinder
    … …
    19: Bibliography B
  • H. A. Bethe and E. E. Salpeter (1957) Quantum mechanics of one- and two-electron atoms. Springer-Verlag, Berlin.
  • L. C. Biedenharn and H. van Dam (Eds.) (1965) Quantum Theory of Angular Momentum. A Collection of Reprints and Original Papers. Academic Press, New York.
  • N. Bleistein (1966) Uniform asymptotic expansions of integrals with stationary point near algebraic singularity. Comm. Pure Appl. Math. 19, pp. 353–370.
  • S. Bochner (1952) Bessel functions and modular relations of higher type and hyperbolic differential equations. Comm. Sém. Math. Univ. Lund [Medd. Lunds Univ. Mat. Sem.] 1952 (Tome Supplementaire), pp. 12–20.
  • W. Bosma and M.-P. van der Hulst (1990) Faster Primality Testing. In Advances in Cryptology—EUROCRYPT ’89 Proceedings, J.-J. Quisquater and J. Vandewalle (Eds.), Lecture Notes in Computer Science, Vol. 434, New York, pp. 652–656.
  • 20: 27.15 Chinese Remainder Theorem
    §27.15 Chinese Remainder Theorem
    The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …