Paper 1, Section II, B

Numerical Analysis | Part II, 2016

(a) Consider the periodic function

f(x)=5+2cos(2πxπ2)+3cos(4πx)f(x)=5+2 \cos \left(2 \pi x-\frac{\pi}{2}\right)+3 \cos (4 \pi x)

on the interval [0,1][0,1]. The NN-point discrete Fourier transform of ff is defined by

FN(n)=1Nk=0N1fkωNnk,n=0,1,,N1F_{N}(n)=\frac{1}{N} \sum_{k=0}^{N-1} f_{k} \omega_{N}^{-n k}, \quad n=0,1, \ldots, N-1

where ωN=e2πi/N\omega_{N}=e^{2 \pi i / N} and fk=f(k/N)f_{k}=f(k / N). Compute F4(n),n=0,,3F_{4}(n), n=0, \ldots, 3, using the Fast Fourier Transform (FFT). Compare your result with what you get by computing F4(n)F_{4}(n) directly from ()(*). Carefully explain all your computations.

(b) Now let ff be any analytic function on R\mathbb{R} that is periodic with period 1 . The continuous Fourier transform of ff is defined by

f^n=01f(τ)e2πinτdτ,nZ\hat{f}_{n}=\int_{0}^{1} f(\tau) e^{-2 \pi i n \tau} d \tau, \quad n \in \mathbb{Z}

Use integration by parts to show that the Fourier coefficients f^n\hat{f}_{n} decay spectrally.

Explain what it means for the discrete Fourier transform of ff to approximate the continuous Fourier transform with spectral accuracy. Prove that it does so.

What can you say about the behaviour of FN(Nn)F_{N}(N-n) as NN \rightarrow \infty for fixed nn ?

Typos? Please submit corrections to this page on GitHub.