Skip to main content

Questions tagged [fast-fourier-transform]

Use this tag for questions related to the fast Fourier transform, an algorithm that samples a signal over a period of time (or space) and divides it into its frequency components.

1 vote
1 answer
76 views

I was reading stuff about discrete Fourier transform (DFT) and its inverse when I produced the following proof which seems to lead to a contradiction for me. I don't know where the error is. Could ...
anthomedal's user avatar
0 votes
1 answer
103 views

I'm trying to compare my numerical vs exact solution to the anti-derivative of the piecewise function $$u(x)=\begin{cases}1,&x<\frac{\pi}{2}\\2,&\frac{\pi}{2}\leq x<\frac{3\pi}{2}\\1,&...
OzymandiusBlorg's user avatar
0 votes
0 answers
27 views

I have a hundred time series, all sampled at the same time interval. I did an FFT of all of these time series and arranged them row by row in a matrix ($\mathbf{X}$). I have a target variable ($\...
ggoogle userr's user avatar
1 vote
0 answers
32 views

Background: Last year, I wrote a Master's thesis on WSS vectors. I derived various WSS process results (such as the Wiener-Khinchin theorem) using vanilla matrix algebra. My intention was, first, to ...
Alexander Ness's user avatar
0 votes
0 answers
44 views

I need to evaluate: $u(x_j) = \sum_{j=0}^N \hat{u}_j \phi_j(x_j) $ where the coefficients $\hat{u}_j$ are known and the interpolation polynomial is: $\phi_j(x)=T_k(x)+a_kT_{k+1}(x)+b_kT_{k+2}(x)$ ...
user1684204's user avatar
1 vote
0 answers
43 views

Let $\mathbf{m}(\mathbf{r})$ be a vector field defined at every point in three-dimensional Euclidean space, subject to the pointwise constraint $|\mathbf{m}(\mathbf{r})|^2 = 1$. I wish to compute ...
Ivan Miranda's user avatar
3 votes
0 answers
76 views

I have a sum of the form $$ c(x) = \sum_{0\leq k\leq n} c_k \cos^kx $$ for some collection of real numbers $c_k$ that I'd like to evaluate at an evenly spaced collection of $m$ points between $0$ and $...
Mathew's user avatar
  • 1,968
0 votes
1 answer
127 views

Suppose we have the following equation: $$A^T A x = A^T G$$ Where $A$ is a square matrix composed of shifted versions of a known vector $v$, represented as: $$A=\begin{pmatrix} v_0 & 0 &...
Graph3r's user avatar
0 votes
1 answer
53 views

I am following the discussion on Using FFT to calculate derivatives and the answer from ConVexHUll. I extended N=2048 and L=64*pi, and fact=1/32. As the plots show, the difference has oscillation ...
user1596366's user avatar
0 votes
0 answers
51 views

If I have a rank r matrix $A\in \mathbb{R}^{n\times n}$, $r<n$. If we do a discrete fourier transform on $A$, we get $\hat{A}$. my question is that the rank of $\hat{A}$ is still r or not. I did ...
Ruin Riddle's user avatar
0 votes
0 answers
100 views

I have been studying digital control theory from the Digital Control of Dynamic Systems. Here in section 12.2 regarding identification of a nonparametric model of a dynamic systems I have found ...
Steve's user avatar
  • 401
1 vote
0 answers
49 views

Let's say I have an $n$x$m$ grid of points in 3D space. The grid has some random displacement along its normal, so it's not just a flat plane. If I take a 2D Fourier transform of the x, y, and z ...
harmvson's user avatar
2 votes
0 answers
104 views

I was studying ways to obtain functions in Taylor Series format from differential equations that describe them, and at one point I came across a special case of linear convolution. I'll use an example ...
Ricardo Augusto's user avatar
2 votes
0 answers
75 views

Assuming the exponential and trigonometric forms of the Fourier series for a $2 \pi$-periodic function are defined as $$f(x)=\sum\limits_{n=-\infty}^\infty c_n\, e^{i n x}\tag{1}$$ and $$f(x)=\frac{1}{...
Steven Clark's user avatar
  • 9,346
0 votes
1 answer
75 views

Let's say I have an digital audio signal that is very short (only a few seconds). This signal is kind of simple (can't come up with a good example, but something like mobile phone notification, or ...
Jake Mayer's user avatar

15 30 50 per page
1
2 3 4 5
32