Changes

{{Template:Math-h}}

{{Math-h}}

The '''Fourier transformation''' (often called the '''Fourier transform''' or '''Fourier integral''') is an invertible [[integral]] transformation that decomposes a square integrable, [[piecewise continuous]] functions on a [[topological group]] into a linear combination of basis elements.  It can be thought of as the ultimate extension of the [[Fourier series]], in which the interval of periodicity becomes infinitely long and the "coefficients" infinitely close together, becoming a function instead of an infinite series.

The '''Fourier transformation''' (often called the '''Fourier transform''' or '''Fourier integral''') is an invertible [[integral]] transformation that decomposes a square integrable, [[piecewise continuous]] functions on a [[topological group]] into a linear combination of basis elements.  It can be thought of as the ultimate extension of the [[Fourier series]], in which the interval of periodicity becomes infinitely long and the "coefficients" infinitely close together, becoming a function instead of an infinite series.

Discrete Fourier transformations are defined on discrete topological groups, and the integral is replaced by summation.

Discrete Fourier transformations are defined on discrete topological groups, and the integral is replaced by summation.

[[category:Calculus]]

[[Category:Calculus]]