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
2
votes
1 answer

Problem with Discrete Parseval's Theorem

I think I must be missing something obvious, but I can't for the life of me see what it is. The discrete version of Parseval's theorem can be written like this: $$\sum_{n=0}^{N-1} |x[n]|^2 = \frac{1}{N}\sum_{n=0}^{N-1} |X[k]|^2 $$ Now, say you've…
2
votes
0 answers

2D Fourier transform of exponentials and cosines

I would like to know the 2D FT of the following functions: 1.$$\exp\left(-\frac{(x-y+a)^2}{b^2}\right)$$ 2.$$\exp\left(-\frac{(x-y+a)^2}{b^2}\right)\cos\left(n\pi\left(x+\frac{1}{2}\right)\right)\cos\left(n\pi\left(y+\frac{1}{2}\right)\right)$$ Any…
JFNJr
  • 1,055
2
votes
1 answer

Verifying Convolution Identities

Note: I don't yet have a solution to my main issue yet which I have elaborated on in the edit. Further attention is deeply appreciated. :> $\bf{\text{Original Question}}$: Let $G$ be a locally compact group, $\mu$ a Haar measure for $G$ and…
roo
  • 5,598
2
votes
3 answers

A question about Fourier series

I have recently discovered what the "Fourier series" of a function is. So the Fourier series of $f(x)=x^2$ in $[0,2\pi]$ is $f(x)=\dfrac{4\pi^2}{3}+\displaystyle\sum_{n=1}^\infty\left(\frac{4}{n^2}\cos(nx)-\frac{4\pi}{n}\sin(nx)\right).$ I plot…
2
votes
3 answers

How to reperesent $\sin^{4}(x)$ byFourier series?

how to represent $\sin^{4}(x)$ by Fourier series? Obviously,$\sin^{4}(x)$ is an even function, so $b_n=0$. How can i get $a_n$ ?
park ning
  • 385
  • 1
  • 3
  • 11
2
votes
1 answer

Is there a function that is not absolutely integrable in $[-\pi,\pi]$ so that its Fourier Series Exists?

For existence of Fourier coefficients of a function $f$ is sufficient that $f$ is absolutely integrable in $[-\pi,\pi]$ but, is this condition necessary? that is, is there a function that is not absolutely integrable in $[-\pi,\pi]$ so that its…
SAS
  • 49
2
votes
1 answer

$b_n$ Fourier series $f(x)=x^3$

I'm having trouble to solve the $b_n$ coefficient of Fourier series of $x^3$ function on the $-\pi
Deiota
  • 567
2
votes
1 answer

Solving Wave equation using Fourier Transforms

My approach is the following: we take Fourier transform with respect to $x$, where $k$ is the variable the resulting fourier transform is in. $\hat{u}_{tt} + k^2 \hat{u} = 0$ Solving this gives me (I think is where I am…
Lost1
  • 7,895
2
votes
2 answers

Explaining why FFT is faster than naive-DFT for the general public?

How would you explain why the Fast Fourier Transform is faster than the naive algorithm for computing the Discrete Fourier Transform, if you had to give a presentation about it for the general (non-mathematical) public?
2
votes
1 answer

How to prove that this finite sum is true

Does anyone know how I could show that $$ \sum_{n = -N_1}^{N_1}{e^{-i\omega n}} = \frac{\sin( \omega ( N_1 - \frac{1}{ 2} ))} {\sin( \frac{\omega}{2} ) } $$ Solution: $$ = \sum_{n=0}^{N_1} ( e^{i \omega n} + e^{-i \omega n} ) - 1 $$ $$ =…
KillaKem
  • 695
2
votes
1 answer

Linear Algebra, Fourier Series

An odd function of period 2$\pi$ is appoximated by a Fourier Series with N terms. The appoximate error as measured by mean-square deviation is $$E_N =\int\limits_{-\pi}^\pi\left( f(x) - \sum_{n=1}^N b_n \sin nx \right)^2 dx$$ By differentiating…
math
  • 1,509
2
votes
0 answers

Show that $\int_{\mathbb{T}}f(x) \overline{g(x)} \mathop{dx} = \sum_{n \in \mathbb{Z}} \hat{f}(n) \overline{\hat{g}(n)}$.

Here, $\hat{f}(n)$ denotes the $n$th Fourier coefficient of $f$, $\overline{f}$ is the complex conjugate of $f$, and $\mathbb{T} = [-\pi, \pi]$. This is my work so far: We begin by using the polarization formula for the inner product and find $$ …
2
votes
1 answer

Finding the Fourier expansion of $f$ using its periodicity and definition on an interval.

I am trying to find the Fourier expansion of $f$, only knowing that $f$ has period $2$ and $f(x) = |x|$ if $-1 < x < 1$. Since $f$ is even, there is no $b_n$ term, which is given by $$b_n = \frac{2}{T} \int _0 ^T f(x) \sin (2\pi n \frac{x}{T} )…
2
votes
2 answers

Why do Fourier coefficients decay slower for unsmooth functions?

Question : Why do Fourier coefficients decay slower for functions that aren't smooth (for example, non differentiable?) A Fourier coefficient is defined as an integral over the function (times a complex number $e^{\text{something}}$). An integral…
saei
  • 77
2
votes
0 answers

How does the Fourier transform act on $\ell^2$?

Given an $L^2(\Bbb R)$ function $f$, let $c_n(f)$ be its $n$th Fourier coefficient. Define an isometry $T: L^2 \to \ell^2$ by $Tf = (c_0(f),c_1(f),\ldots)$. Let $F$ be the Fourier transform operator; it's an isometry on $L^2$. So how does $T\circ F$…