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
0 answers

Infinite sum of an alternating series in the topic of Fourier analysis.

I have been given the task of showing that $\sum_{-\infty}^{\infty} \frac{(-1)^{n-1}}{n^2-\frac{1}{4}} = 2\pi$ and quite frankly I am stuck. So far I have shown that $|c_n|^2 = \sum_{-\infty}^{\infty} \frac{1}{(n^2-\frac{1}{4})^2} = 2\pi^2$ by using…
2
votes
1 answer

Using Fourier Analysis to fit function to data

I have 24 values for $Y$ and corresponding 24 values for $t$. The Y values are measured experimentally, while t has values $t=1,2,\dots 24$. I want to find the relationship between Y and t as an equation using Fourier analysis. I wrote the…
user4700
2
votes
2 answers

How to realise N-point FFT?

For example, if I need to calculate 15 point fft, I can use DFT. But it is a long process. As far as I know, FFT can be used when the size is 2^n. What are the efficient ways to perform a 15 point DFT?
2
votes
2 answers

Exercise - Fourier Transform

I have got another question concerning the Fourier transform. I hope somebody can help me. Let $f \in L^1(\mathbb{R}^n)$. Prove that $\hat{f}$ is continous. (ok, I was able to show it) If $supp(f)$ is compact then $\hat{f}$ is infinitely often…
Mathoman
  • 707
2
votes
1 answer

Fourier Series of $f=x$ in $[0,2\pi)$

I have to find the Fourier Series of $f=x$ in $[0,2\pi)$, I already know that $g=x$ in $[-\pi,\pi)$ is $$\sum_{n=1}^\infty \frac{(-1)^n (-2) }{n} \sin(nx) $$ How does the difference in the region change me, since in both regions the period is…
2
votes
1 answer

Understanding uniform bound for partial sum

I need help understanding the last part of a proof in Fourier analysis. Claim is that partial sums $\sum_{n=1}^N \frac{\sin (nx)}{x}$ are uniformly bounded for all $n$ and all $x \in \mathbb{R}$. Starting with $x \in (0,\pi)$ and $M = \min(N,…
SAS
  • 1,066
  • 9
  • 18
2
votes
1 answer

Show that there does not exist $k\in L^1(\mathbb{T})$ such that $k*f=f$

I've been trying to prove that there does not exist $k\in L^1(\mathbb{T})$ such that $k*f=f$ for every continuous function $f:\mathbb{T} \rightarrow \mathbb{C}$. The exercise says to use the Riemann-Lebesgue lemma. So what I've tried is this: Since…
PLY
  • 231
  • 1
  • 10
2
votes
1 answer

Derivation of the discrete Fourier transform - for dummies

I'm finding it hard to find a derivation of the DFT from books, was wondering if someone can point me to some resources or attempt to explain it here.
chutsu
  • 276
2
votes
0 answers

Fourier Transform of f(t)=|t|

This is a question on taking the Fourier transform of a function. How does one find the fourier transform of $f$, where $f(t) = |t|$?
NicNic8
  • 6,951
2
votes
2 answers

Fourier transform terms explained

I know there are lots of tutorial on different webpages.. but I am not an engineering student... those look quite complex to me.. Could anybody explain what is "Fourier transform" in the very simple sentences so non-engineer background people can…
justyy
  • 133
2
votes
1 answer

Cosine series of $x^3$

After constructing an even extension, and evaluating over $-\pi \le x \le \pi$ $$\frac \pi2a_n=\int_0^\pi x^3\cos nx\ dx $$ Now I've tried to solve this, I wish I had the skills and the patience to mathjax-ify my steps here but it'll be too much to…
2
votes
2 answers

Fourier Transform Confusion

According to Wikipedia, the Fourier transform $\hat f$ of an integrable function $f:\mathbb{R}\to\mathbb{C}$ is defined by $$ \hat f\left(\xi\right)=\int_{-\infty}^{\infty}f\left(x\right)e^{-2\pi ix\xi}dx.\tag{1} $$ Consider…
wjmolina
  • 6,218
  • 5
  • 45
  • 96
2
votes
2 answers

Negative exponent Fourier Transform of Sequences

Why the exponent must be a negative in the Fourier transform of any sequence? What happens with expressions $$x(m)=\dfrac{1}{2\pi}\int_{-\pi}^{\pi}X(w)\exp(jmw)dw$$ if we define the Fourier transform of sequences…
juaninf
  • 1,264
2
votes
1 answer

Multiplication using an FFT

I'm exploring the use of FFTs for multiplication, but even with simple examples it seems to go wrong. For example, here I'm trying to multiply $1$ by $2x$ (code is in matlab, but I think you can probably understand it even if you don't know the…
Xodarap
  • 6,115
2
votes
1 answer

Inverse fourier transform of $f(x)=\frac{\text{u}(x)}{\sqrt{1-x^2}}$

How to calculate (or derive) the inverse Fourier transform of $$f(x)=\frac{\text{u}(x)}{\sqrt{1-x^2}}$$ where $u(x)$ is the rectangular function? I know that $f(x)$ is the Fourier transform of the Bessel function, so its inverse must be the Bessel…
user47728