All Questions
3 questions
3
votes
1
answer
2k
views
Deconvolution using the discrete Fourier transform
Summary: From discrete convolution theorem, it is understandable that we need 2N-1 point DFT of both sequences in order to avoid circular convolution. If we need to do deconvolution of a given ...
2
votes
1
answer
1k
views
Solving a simple Schrödinger equation with Fast Fourier Transforms
While trying to solve a stochastic Gross-Pitaevskii equation I have found a problem that can be tracked down to something buggy occurring in the simplest Schrodinger equation possible:
$$\partial_t \...
0
votes
1
answer
179
views
A kind of Discrete Fourier Transform
Given a $z\in \mathbb{C}^N$, the DFT of $z$ is given for every $k\in [0,N-1]_\mathbb{N}$ by
$$DFT_z(k)=\frac{1}{N} \sum_{j=0}^{N-1} z_j\, \omega^{-k j}$$ where I have denoted by $\omega$ the $N$-th ...