Questions tagged [fourier-analysis]

Fourier analysis, also known as spectral analysis, encompasses all sorts of Fourier expansions, including Fourier series, Fourier transform and the discrete Fourier transform (and relatives). The non-commutative analog is (representation-theory).

Fourier analysis is the study of how general functions can be decomposed into trigonometric or exponential functions with definite frequencies. There are two types of Fourier expansions:

  • Fourier series: If a (reasonably well-behaved) function is periodic, then it can be written as a discrete sum of trigonometric or exponential functions with specific frequencies.
  • Fourier transform: A general function that isn’t necessarily periodic (but that is still reasonably well-behaved) can be written as a continuous integral of trigonometric or exponential functions with a continuum of possible frequencies.

The reason why Fourier analysis is so important is that many (although certainly not all) of the differential equations that govern physical systems are linear, which implies that the sum of two solutions is again a solution. Therefore, since Fourier analysis tells us that any function can be written in terms of sinusoidal functions, we can limit our attention to these functions when solving the differential equations. And then we can build up any other function from these special ones. This is a very helpful strategy, because it is invariably easier to deal with sinusoidal functions than general ones.

Fourier series

Consider a function $f(x)$ that is periodic on the interval $0 ≤ x ≤ L$, then Fourier’s theorem states that $f(x)$ can be written as $$f(x)={a_0}+\sum_{n=1}^{\infty}\left[a_n \cos\left(\frac{2n\pi x}{L}\right)+b_n \sin \left(\frac{2n\pi x}{L}\right)\right]$$ where the constant coefficients $a_n$ and $b_n$ are called the Fourier coefficients of $f$ and is given by $$a_0=\frac{1}{L}\int_0^L f(x)\mathrm{d}x$$ $$a_n=\frac{2}{L}\int_0^L f(x)\cos\left(\frac{2\pi nx }{L}\right)\mathrm{d}x$$ $$b_n=\frac{2}{L}\int_0^L f(x)\sin\left(\frac{2\pi nx }{L}\right)\mathrm{d}x$$

Reference:

http://www.people.fas.harvard.edu/~djmorin/waves/Fourier.pdf

https://en.wikipedia.org/wiki/Fourier_analysis

http://mathworld.wolfram.com/FourierSeries.html

Fourier Transform:

For this part find the following link

https://math.stackexchange.com/tags/fourier-transform/info

10420 questions
1
vote
2 answers

Using the Duality of the Fourier Transform

How would I use the duality of the Fourier transform to find the inverse Fourier transform of $$ X(\omega) = 2\pi e^{a\omega} u(-\omega)? $$
1
vote
0 answers

Finding the natural frequency of a system via a Fourier Transform

This is a mechanical engineering question with its roots in Mathematics and so I felt this was the best stack exchange site to post my question. In short, I have used a device to measure the magnitude of acceleration of my body every second that I…
1
vote
1 answer

Can a Fourier Transform be used to 'limit' the amplitude of a signal?

I never got a chance to study Fourier Transforms in school. What I do know about them (which isn't much) I have gleaned from the web. I understand that you can transform any periodic signal between the time domain and the frequency domain. So…
C Shreve
  • 561
1
vote
0 answers

A Question on Fourier analysis

The following is an exercise in Knapp's book, representation theory of Semisimple Groups. For $f\in C_c^\infty(\mathbb R^2-\{0\})$ with norm $$\|f\|^2=\int_{-\infty}^\infty\int_{-\infty}^\infty |f(x,y)|^2 dx dy,$$ define $E_v:f\mapsto F_v$…
1
vote
1 answer

Please help prove Fourier transform pair

Can any one please help me prove the below Fourier transform pair $$\frac{1}{\sqrt{|\omega|}} =\frac{1}{\sqrt{2\pi}} \int_{-\infty}^{\infty}e^{-i\omega t}\frac{1}{\sqrt{|t|}}\,dt.$$
1
vote
1 answer

What ( fast ) algorithm for evaluating a nine point DFT could be used?

What ( fast ) algorithm for evaluating a nine point DFT could be used? $$ G={V^{(9)}\over{\sqrt{9}}}g=\begin{bmatrix} &1 &1 &\cdots &1 &1 \\ &z_0 &z_1 &\cdots &z_7 &z_8 \\ &z_0^2 &z_1^2 &\cdots &z_7^2 &z_8^2 \\ &\vdots &\vdots & …
1
vote
1 answer

Fourier transformation of heaviside functions

I need to know the value of following integration. $\frac{1}{2\pi}\int_{-\infty}^{\infty}dx_{1}dx_{2} e^{i k_{1}x_{1} +ik_{2}x_{2}} \theta(x_{1})\theta(x_{2}-x_{1})$, where $\theta$ is Heaviside theta function. Above integration looks like a…
Veteran
  • 145
1
vote
2 answers

A property of the Fourier transform

I need a hand proving this property involving Fourier transforms: If we have $F,G\in L^2(\mathbb{R})$, and we denote the Fourier transform as $T$, where $T(F)(\xi)=\int_{\mathbb{R}}F(x)e^{-i\xi x}\;dx$, then the following identity…
Mark_Hoffman
  • 1,509
1
vote
1 answer

Fourier transform on a general finite group on a set of symbols

I'd like to perform Fourier analysis on a sequence of n symbols or letters, but on a general finite group. For a cyclic group (the usual Fourier transform), I found (J. Math. Biol, 36(1997):pp.64-70) an approach where each symbol is replaced by a…
AlexPof
  • 1,029
1
vote
0 answers

Why is this an inverse fourier cosine transform?

I would like to understand the principle of Fourier transform spectroscopy. This is explained in Wikipedia. I did all the modeling of the system and I got the same formula: $$ I(p,\tilde{\nu}) = I(\tilde{\nu})[1 + \cos(2\pi\tilde{\nu}p)] $$ where…
Blup1980
  • 131
1
vote
0 answers

Fourier transform evaluation

Let $x\in \mathbb{R}^n$ and $h(x)=\left\{\begin{array}{cc} 1 & ,|x|<1\\ 0 & ,|x|\geq 1 \end{array}\right.$ I want to find the Fourier transform , $\hat{h}(\xi).$ Here is how I proceed …
Math
  • 137
  • 3
1
vote
0 answers

Is the definition of DTFT using $\omega$ wrong?

I'll briefly explain this problem I faced. Let's take this simple signal: $$x(n)=\cos(\pi n)$$ The signal is not absolutely summable, however we can define its DTFT in terms of distributions. That is: $$X(e^{j\omega})=2\pi \delta(\omega+\pi+2\pi…
alain
  • 11
1
vote
1 answer

Integrating $\frac{\sin ^2(x)}{x^2}$

Fourier transforming the function: $$f(t) = \left\{ \begin{array}{ll} 1; & \mbox{ } |t| \leq 1 \\ 0; & \mbox{otherwise} \end{array} \right.$$ We get: $$F(y)=2 \frac{\sin y}{y}$$ And now applying Parseval's identity for the Fourier…
gndz
  • 423
1
vote
1 answer

Fourier analysis question

Let $f(t)=\frac 12 -t, t\in(0,1).$ Calculate the Fourier coefficients of the function $f$ and the sum $\sum_{n=1}^{\infty} \frac {1}{n^2}$. Note that $L^2 (\Bbb{T}) \to l^2(\Bbb{Z})$ and $\sum_{n\in\Bbb{Z}}|\hat{f}(n)|^2 =\int_0^1 |f(t)|^2 dt$ .
ELEC
  • 1,113
1
vote
0 answers

Number of roots of sine-and-cosine expression

Is there an easy proof of the following fact? Let $a_0, \ldots, a_n, b_1, \ldots, b_n$ be real numbers, not all zero. Then, the function $$a_0 + a_1 \cos x + b_1 \sin x + a_2\cos 2x+b_2\sin 2x+\ldots+ a_n \cos nx + b_n \sin nx$$ has at most $2n$…