User Tools

Site Tools


math121a-f23:october_13_friday

This is an old revision of the document!


October 13, Friday

Parseval Equality says, Fourier transformation, as a linear map from one function space (function on x), to another function space (function on p), preserves 'norm'. Norm is just a fancy way of saying 'length of a vector'.

What do we mean by the length of a function?

FT Conventions

Continuous Fourier transformation (OK, I switched to Boas convention) f(x)=RF(p)eipxdp. f(x) = \int_\R F(p) e^{ipx} dp. F(p)=(1/2π)Rf(x)eipxdx. F(p) = (1/2\pi) \int_\R f(x) e^{-ipx} dx.

Discrete Fourier transformation (OK, I switched to Boas convention) Fix a positive integer NN. x,px,p are valued in Z/NZ{0,1,,N1}\Z / N\Z \cong \{0,1,\cdots, N-1\}. f(x)=pZ/NZF(p)F(p)e2πipx/N. f(x) = \sum_{p \in \Z / N\Z} F(p) F(p) e^{2\pi i \cdot px/N}. F(p)=(1/N)pZ/NZf(x)e2πipx/N. F(p) = (1/N) \sum_{p \in \Z / N\Z} f(x) e^{-2\pi i \cdot px/N}.

math121a-f23/october_13_friday.1697268481.txt.gz · Last modified: 2023/10/14 00:28 by pzhou