About the Project

discrete%20Fourier%20transform

AdvancedHelp

(0.002 seconds)

21—30 of 283 matching pages

21: 8 Incomplete Gamma and Related
Functions
22: 28 Mathieu Functions and Hill’s Equation
23: 28.35 Tables
§28.35 Tables
  • Ince (1932) includes eigenvalues a n , b n , and Fourier coefficients for n = 0 or 1 ( 1 ) 6 , q = 0 ( 1 ) 10 ( 2 ) 20 ( 4 ) 40 ; 7D. Also ce n ( x , q ) , se n ( x , q ) for q = 0 ( 1 ) 10 , x = 1 ( 1 ) 90 , corresponding to the eigenvalues in the tables; 5D. Notation: a n = 𝑏𝑒 n 2 q , b n = 𝑏𝑜 n 2 q .

  • Kirkpatrick (1960) contains tables of the modified functions Ce n ( x , q ) , Se n + 1 ( x , q ) for n = 0 ( 1 ) 5 , q = 1 ( 1 ) 20 , x = 0.1 ( .1 ) 1 ; 4D or 5D.

  • National Bureau of Standards (1967) includes the eigenvalues a n ( q ) , b n ( q ) for n = 0 ( 1 ) 3 with q = 0 ( .2 ) 20 ( .5 ) 37 ( 1 ) 100 , and n = 4 ( 1 ) 15 with q = 0 ( 2 ) 100 ; Fourier coefficients for ce n ( x , q ) and se n ( x , q ) for n = 0 ( 1 ) 15 , n = 1 ( 1 ) 15 , respectively, and various values of q in the interval [ 0 , 100 ] ; joining factors g e , n ( q ) , f e , n ( q ) for n = 0 ( 1 ) 15 with q = 0 ( .5  to  10 ) 100 (but in a different notation). Also, eigenvalues for large values of q . Precision is generally 8D.

  • Zhang and Jin (1996, pp. 521–532) includes the eigenvalues a n ( q ) , b n + 1 ( q ) for n = 0 ( 1 ) 4 , q = 0 ( 1 ) 50 ; n = 0 ( 1 ) 20 ( a ’s) or 19 ( b ’s), q = 1 , 3 , 5 , 10 , 15 , 25 , 50 ( 50 ) 200 . Fourier coefficients for ce n ( x , 10 ) , se n + 1 ( x , 10 ) , n = 0 ( 1 ) 7 . Mathieu functions ce n ( x , 10 ) , se n + 1 ( x , 10 ) , and their first x -derivatives for n = 0 ( 1 ) 4 , x = 0 ( 5 ) 90 . Modified Mathieu functions Mc n ( j ) ( x , 10 ) , Ms n + 1 ( j ) ( x , 10 ) , and their first x -derivatives for n = 0 ( 1 ) 4 , j = 1 , 2 , x = 0 ( .2 ) 4 . Precision is mostly 9S.

  • 24: 8.26 Tables
  • Khamis (1965) tabulates P ( a , x ) for a = 0.05 ( .05 ) 10 ( .1 ) 20 ( .25 ) 70 , 0.0001 x 250 to 10D.

  • Abramowitz and Stegun (1964, pp. 245–248) tabulates E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x = 0 ( .01 ) 2 to 7D; also ( x + n ) e x E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x 1 = 0 ( .01 ) 0.1 ( .05 ) 0.5 to 6S.

  • Pagurova (1961) tabulates E n ( x ) for n = 0 ( 1 ) 20 , x = 0 ( .01 ) 2 ( .1 ) 10 to 4-9S; e x E n ( x ) for n = 2 ( 1 ) 10 , x = 10 ( .1 ) 20 to 7D; e x E p ( x ) for p = 0 ( .1 ) 1 , x = 0.01 ( .01 ) 7 ( .05 ) 12 ( .1 ) 20 to 7S or 7D.

  • Zhang and Jin (1996, Table 19.1) tabulates E n ( x ) for n = 1 , 2 , 3 , 5 , 10 , 15 , 20 , x = 0 ( .1 ) 1 , 1.5 , 2 , 3 , 5 , 10 , 20 , 30 , 50 , 100 to 7D or 8S.

  • 25: 23 Weierstrass Elliptic and Modular
    Functions
    26: Bibliography H
  • P. I. Hadži (1973) The Laplace transform for expressions that contain a probability function. Bul. Akad. Štiince RSS Moldoven. 1973 (2), pp. 78–80, 93 (Russian).
  • N. Hale and A. Townsend (2016) A fast FFT-based discrete Legendre transform. IMA J. Numer. Anal. 36 (4), pp. 1670–1684.
  • E. W. Hansen (1985) Fast Hankel transform algorithm. IEEE Trans. Acoust. Speech Signal Process. 32 (3), pp. 666–671.
  • P. Henrici (1986) Applied and Computational Complex Analysis. Vol. 3: Discrete Fourier Analysis—Cauchy Integrals—Construction of Conformal Maps—Univalent Functions. Pure and Applied Mathematics, Wiley-Interscience [John Wiley & Sons Inc.], New York.
  • F. T. Howard (1996a) Explicit formulas for degenerate Bernoulli numbers. Discrete Math. 162 (1-3), pp. 175–185.
  • 27: 6.16 Mathematical Applications
    Consider the Fourier series … Compare Figure 6.16.1. … It occurs with Fourier-series expansions of all piecewise continuous functions. … …
    See accompanying text
    Figure 6.16.2: The logarithmic integral li ( x ) , together with vertical bars indicating the value of π ( x ) for x = 10 , 20 , , 1000 . Magnify
    28: Bibliography Z
  • D. Zeilberger and D. M. Bressoud (1985) A proof of Andrews’ q -Dyson conjecture. Discrete Math. 54 (2), pp. 201–224.
  • A. H. Zemanian (1987) Distribution Theory and Transform Analysis, An Introduction and Generalized Functions with Applications. Dover, New York.
  • Q. Zheng (1997) Generalized Watson Transforms and Applications to Group Representations. Ph.D. Thesis, University of Vermont, Burlington,VT.
  • Ya. M. Zhileĭkin and A. B. Kukarkin (1995) A fast Fourier-Bessel transform algorithm. Zh. Vychisl. Mat. i Mat. Fiz. 35 (7), pp. 1128–1133 (Russian).
  • 29: Bibliography O
  • F. Oberhettinger and T. P. Higgins (1961) Tables of Lebedev, Mehler and Generalized Mehler Transforms. Mathematical Note Technical Report 246, Boeing Scientific Research Lab, Seattle.
  • F. Oberhettinger (1990) Tables of Fourier Transforms and Fourier Transforms of Distributions. Springer-Verlag, Berlin.
  • F. Oberhettinger (1972) Tables of Bessel Transforms. Springer-Verlag, Berlin-New York.
  • F. Oberhettinger (1973) Fourier Expansions. A Collection of Formulas. Academic Press, New York-London.
  • 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.
  • 30: 36 Integrals with Coalescing Saddles