About the Project
NIST

discrete Fourier transform

AdvancedHelp

(0.002 seconds)

5 matching pages

1: 3.11 Approximation Techniques
Example. The Discrete Fourier Transform
is called a discrete Fourier transform pair. … The direct computation of the discrete Fourier transform (3.11.38), that is, of …
2: 24.19 Methods of Computation
  • A method related to “Stickelberger codes” is applied in Buhler et al. (2001); in particular, it allows for an efficient search for the irregular pairs ( 2 n , p ) . Discrete Fourier transforms are used in the computations. See also Crandall (1996, pp. 120–124).

  • 3: 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).
  • R. A. Handelsman and J. S. Lew (1970) Asymptotic expansion of Laplace transforms near the origin. SIAM J. Math. Anal. 1 (1), pp. 118–130.
  • 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.
  • 4: Bibliography W
  • G. N. Watson (1910) The cubic transformation of the hypergeometric function. Quart. J. Pure and Applied Math. 41, pp. 70–79.
  • F. J. W. Whipple (1927) Some transformations of generalized hypergeometric series. Proc. London Math. Soc. (2) 26 (2), pp. 257–272.
  • G. Wolf (2008) On the asymptotic behavior of the Fourier coefficients of Mathieu functions. J. Res. Nat. Inst. Standards Tech. 113 (1), pp. 11–15.
  • R. Wong and J. F. Lin (1978) Asymptotic expansions of Fourier transforms of functions with logarithmic singularities. J. Math. Anal. Appl. 64 (1), pp. 173–180.
  • R. Wong and H. Y. Zhang (2009b) On the connection formulas of the third Painlevé transcendent. Discrete Contin. Dyn. Syst. 23 (1-2), pp. 541–560.
  • 5: Bibliography Z
  • D. Zeilberger and D. M. Bressoud (1985) A proof of Andrews’ q -Dyson conjecture. Discrete Math. 54 (2), pp. 201–224.
  • 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).