119
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: − + + + + + + + + +
Put in actual formulas -- way too elegant to omit.
Fourier transformation is an invertible integral transformation that decompose a square integrable, [[piecewise continuous functions ]] on a [[topological group]] into a linear combination of basis elements.
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.
Often, functions which are difficult to analyze in one topological group become much easier to analyze when transformed to another topological group.
Often, functions which are difficult to analyze in one topological group become much easier to analyze when transformed to another topological group.
The formulas usually favored by mathematicians are the "normalized" form. Given a function f(t) defined on the entire real line, its Fourier transform g(x) is given by:
:<math>g(x) = \frac{1}{\sqrt{2\pi}} \int_{-\infty}^{\infty} f(t) e^{-ixt}\, dt</math>
The inverse transform, that recovers the original function, is:
:<math>f(t) = \frac{1}{\sqrt{2\pi}} \int_{-\infty}^{\infty} g(x) e^{ixt}\, dx</math>
==Discrete Fourier transformation==
==Discrete Fourier transformation==