# Fourier transform

(0.003 seconds)

## 1—10 of 34 matching pages

##### 1: 1.14 Integral Transforms
###### Inversion
In this subsection we let $F_{c}(x)=\mathscr{F}_{\mkern-3.0muc}\mskip-1.0muf\mskip 3.0mu\left(x\right)$, $F_{s}(x)=\mathscr{F}_{\mkern-2.0mus}\mskip-1.0muf\mskip 3.0mu\left(x\right)$, $G_{c}(x)=\mathscr{F}_{\mkern-3.0muc}\mskip-1.0mug\mskip 3.0mu\left(x\right)$, and $G_{s}(x)=\mathscr{F}_{\mkern-2.0mus}\mskip-1.0mug\mskip 3.0mu\left(x\right)$. …
###### FourierTransform
where $\mathscr{F}\mskip-3.0muf\mskip 3.0mu\left(x\right)$ is given by (1.14.1). …
##### 2: 1.16 Distributions
###### §1.16(vii) FourierTransforms of Tempered Distributions
Then its Fourier transform is … The Fourier transform $\mathscr{F}\left(u\right)$ of a tempered distribution is again a tempered distribution, and …
###### §1.16(viii) FourierTransforms of Special Distributions
Since $\sqrt{2\pi}\mathscr{F}\left(\delta\right)=1$, we have …
##### 3: 27.17 Other Applications
###### §27.17 Other Applications
Reed et al. (1990, pp. 458–470) describes a number-theoretic approach to Fourier analysis (called the arithmetic Fourier transform) that uses the Möbius inversion (27.5.7) to increase efficiency in computing coefficients of Fourier series. …
##### 4: 15.17 Mathematical Applications
Harmonic analysis can be developed for the Jacobi transform either as a generalization of the Fourier-cosine transform1.14(ii)) or as a specialization of a group Fourier transform. …
##### 5: Wolter Groenevelt
Groenevelt has research interests in special functions, (matrix valued) orthogonal polynomials, moment problems, generalized Fourier transforms in relations with mathematical objects such as Lie algebras, quantum groups and affine Hecke algebras. …
##### 6: 15.14 Integrals
Fourier transforms of hypergeometric functions are given in Erdélyi et al. (1954a, §§1.14 and 2.14). Laplace transforms of hypergeometric functions are given in Erdélyi et al. (1954a, §4.21), Oberhettinger and Badii (1973, §1.19), and Prudnikov et al. (1992a, §3.37). …
##### 8: 30.15 Signal Analysis
###### §30.15(iii) FourierTransform
Equations (30.15.4) and (30.15.6) show that the functions $\phi_{n}$ are $\sigma$-bandlimited, that is, their Fourier transform vanishes outside the interval $[-\sigma,\sigma]$. …
##### 9: Errata
• Section 1.14

There have been extensive changes in the notation used for the integral transforms defined in §1.14. These changes are applied throughout the DLMF. The following table summarizes the changes.

Previously, for the Fourier, Fourier cosine and Fourier sine transforms, either temporary local notations were used or the Fourier integrals were written out explicitly.

• Subsection 1.16(vii)

Several changes have been made to

1. (i)

make consistent use of the Fourier transform notations $\mathscr{F}\left(f\right)$, $\mathscr{F}\left(\phi\right)$ and $\mathscr{F}\left(u\right)$ where $f$ is a function of one real variable, $\phi$ is a test function of $n$ variables associated with tempered distributions, and $u$ is a tempered distribution (see (1.14.1), (1.16.29) and (1.16.35));

2. (ii)

introduce the partial differential operator $\mathbf{D}$ in (1.16.30);

3. (iii)

clarify the definition (1.16.32) of the partial differential operator $P(\mathbf{D})$; and

4. (iv)

clarify the use of $P(\mathbf{D})$ and $P(\mathbf{x})$ in (1.16.33), (1.16.34), (1.16.36) and (1.16.37).

• Subsection 1.16(viii)

An entire new Subsection 1.16(viii) Fourier Transforms of Special Distributions, was contributed by Roderick Wong.

• ##### 10: 3.11 Approximation Techniques
###### Example. The Discrete FourierTransform
is called a discrete Fourier transform pair.
###### The Fast FourierTransform
The direct computation of the discrete Fourier transform (3.11.38), that is, of …The method of the fast Fourier transform (FFT) exploits the structure of the matrix $\boldsymbol{{\Omega}}$ with elements $\omega_{n}^{jk}$, $j,k=0,1,\dots,n-1$. …