About the Project

Hille–Hardy formula

AdvancedHelp

(0.002 seconds)

1—10 of 264 matching pages

1: Bibliography H
  • G. H. Hardy and S. Ramanujan (1918) Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. (2) 17, pp. 75–115.
  • C. J. Hill (1828) Über die Integration logarithmisch-rationaler Differentiale. J. Reine Angew. Math. 3, pp. 101–159.
  • G. W. Hill and A. W. Davis (1973) Algorithm 442: Normal deviate. Comm. ACM 16 (1), pp. 51–52.
  • I. D. Hill (1973) Algorithm AS66: The normal integral. Appl. Statist. 22 (3), pp. 424–427.
  • E. Hille (1929) Note on some hypergeometric series of higher order. J. London Math. Soc. 4, pp. 50–54.
  • 2: Bibliography Z
  • R. Zanovello (1977) Integrali di funzioni di Anger, Weber ed Airy-Hardy. Rend. Sem. Mat. Univ. Padova 58, pp. 275–285 (Italian).
  • A. H. Zemanian (1987) Distribution Theory and Transform Analysis, An Introduction and Generalized Functions with Applications. Dover, New York.
  • M. I. Žurina and L. N. Karmazina (1966) Tables and formulae for the spherical functions P 1 / 2 + i τ m ( z ) . Translated by E. L. Albasiny, Pergamon Press, Oxford.
  • 3: Bibliography R
  • S. Ramanujan (1962) Collected Papers of Srinivasa Ramanujan. Chelsea Publishing Co., New York.
  • S. O. Rice (1954) Diffraction of plane radio waves by a parabolic cylinder. Calculation of shadows behind hills. Bell System Tech. J. 33, pp. 417–504.
  • W. Rudin (1966) Real and complex analysis. McGraw-Hill Book Co., New York-Toronto, Ont.-London.
  • W. Rudin (1973) Functional Analysis. McGraw-Hill Book Co., New York.
  • W. Rudin (1976) Principles of Mathematical Analysis. 3rd edition, McGraw-Hill Book Co., New York.
  • 4: 28 Mathieu Functions and Hill’s Equation
    Chapter 28 Mathieu Functions and Hill’s Equation
    5: 18.18 Sums
    §18.18(iv) Connection and Inversion Formulas
    §18.18(v) Linearization Formulas
    Formula (18.18.27) is known as the HilleHardy formula. … Formula (18.18.28) is known as the Mehler formula. …
    6: 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 p ( n ) for n < N . …To compute a particular value p ( n ) it is better to use the Hardy–Ramanujan–Rademacher series (27.14.9). … A recursion formula obtained by differentiating (27.14.18) can be used to calculate Ramanujan’s function τ ( n ) , and the values can be checked by the congruence (27.14.20). …
    7: Bibliography J
  • E. Jahnke, F. Emde, and F. Lösch (1966) Tafeln höherer Funktionen (Tables of Higher Functions). 7th edition, B. G. Teubner, Stuttgart (Bilingual).
  • E. Jahnke and F. Emde (1945) Tables of Functions with Formulae and Curves. 4th edition, Dover Publications, New York.
  • X.-S. Jin and R. Wong (1999) Asymptotic formulas for the zeros of the Meixner polynomials. J. Approx. Theory 96 (2), pp. 281–300.
  • F. Johansson (2012) Efficient implementation of the Hardy-Ramanujan-Rademacher formula. LMS J. Comput. Math. 15, pp. 341–359.
  • 8: Bibliography K
  • J. Kamimoto (1998) On an integral of Hardy and Littlewood. Kyushu J. Math. 52 (1), pp. 249–263.
  • A. A. Kapaev and A. V. Kitaev (1993) Connection formulae for the first Painlevé transcendent in the complex domain. Lett. Math. Phys. 27 (4), pp. 243–252.
  • R. P. Kelisky (1957) On formulas involving both the Bernoulli and Fibonacci numbers. Scripta Math. 23, pp. 27–35.
  • E. J. Konopinski (1981) Electromagnetic Fields and Relativistic Particles. International Series in Pure and Applied Physics, McGraw-Hill Book Co., New York.
  • T. H. Koornwinder (1977) The addition formula for Laguerre polynomials. SIAM J. Math. Anal. 8 (3), pp. 535–540.
  • 9: 28.29 Definitions and Basic Properties
    §28.29(i) Hill’s Equation
    §28.29(ii) Floquet’s Theorem and the Characteristic Exponent
    10: Simon Ruijsenaars