Difference between revisions of "Fourier transformation"
Jump to navigation
Jump to search
m |
|||
| Line 1: | Line 1: | ||
| − | Fourier transformation is an invertible integral transformation that decompose a square integrable, [[piecewise continuous | + | Fourier transformation is an invertible integral transformation that decompose a square integrable, [[piecewise Piecewise continuous function]] on a [[topological group]] into a linear combination of basis elements. |
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. | ||
Revision as of 01:58, March 24, 2007
Fourier transformation is an invertible integral transformation that decompose a square integrable, piecewise Piecewise continuous function on a topological group into a linear combination of basis elements.
Often, functions which are difficult to analyze in one topological group become much easier to analyze when transformed to another topological group.
Discrete Fourier transformation
Discrete Fourier transformations are defined on discrete topological groups, and the integral is replaced by summation.