Fourier Methods - Core Definitions
Fourier methods transform PDEs into algebraic equations in frequency space, providing powerful tools for both analysis and computation. These techniques exploit the diagonalizing property of Fourier bases for differential operators.
DefinitionFourier Series
For a 2Ο-periodic function f(x), the Fourier series is:
f(x)=2a0ββ+βn=1ββ[anβcos(nx)+bnβsin(nx)]
where the Fourier coefficients are:
anβ=Ο1ββ«βΟΟβf(x)cos(nx)dx,bnβ=Ο1ββ«βΟΟβf(x)sin(nx)dx
In complex form: f(x)=βn=ββββcnβeinx where cnβ=2Ο1ββ«βΟΟβf(x)eβinxdx.
DefinitionFourier Transform
For functions on Rn, the Fourier transform is:
f^β(ΞΎ)=F[f](ΞΎ)=β«Rnβf(x)eβ2Οixβ
ΞΎdx
The inverse Fourier transform is:
f(x)=Fβ1[f^β](x)=β«Rnβf^β(ΞΎ)e2Οixβ
ΞΎdΞΎ
Key Property: Fourier transform converts differentiation to multiplication:
F[βxjββfβ]=2ΟiΞΎjβf^β(ΞΎ)
This transforms the PDE β2u=f to the algebraic equation β4Ο2β£ΞΎβ£2u^=f^β.
Remark
The exponential decay eβ4Ο2kβ£ΞΎβ£2t in frequency space corresponds to smoothing in physical space: high frequencies (rough features) are damped more rapidly. This explains the smoothing property of the heat equation from a frequency perspective.
Fourier methods are particularly powerful for PDEs with constant coefficients on simple domains (whole space, periodic domains, or domains where separation of variables applies).