# Tagged Questions

81 views

### Numerical calculation of Fourier transform with a nice error bound

I'd like to have an algorithm for a numerical calculation of Fourier transform with a nice error bound. To be precise, if $f$ is a function from $L_1(R)$, $F[f]$ is it's exact Fourier transform and ...
100 views

### Seeking a class of functions for which sums approximate integrals well

Is there a "natural" class of integrable functions $f: {\mathbb R} \rightarrow {\mathbb R}$ for which it is true (and, preferably, not too hard to prove!) that $\sup_{0 \leq a < h} |h S(a,h) - I|$ ...
85 views

### Error of midpoint method for differentiable functions

Is it the case that for every differentiable function $f$ on $[0,1]$ (with finite one-sided derivatives at the endpoints), the midpoint method of estimating $\int_0^1 f(x) \: dx$ has error $o(1/n)$? ...
129 views

### Using Fourier Transform to speed up calculation of forces following an inverse square law

Suppose I have $n$ electric point charges in, say, two dimensions. Is there any algorithm (and I have a hunch that it might be related to the Fourier transform) to compute the net forces that act on ...
595 views

### Frequency calculation using fourier transform [closed]

How to calculate the frequency of an audio file using Fourier Transform
236 views

### Convergence of Fourier series for $C^p$ functions

Let $f \in C^p[0,2\pi]$ and periodic. Denote $\omega_p$ as the moduli of continuous of $f^{(p)}$. Then $|f - S_Nf| \le K \frac{\log{N}}{N^p}\omega_p(2\pi/N),$ where $S_N$ is the Fourier partial sum ...
116 views

### Finding peaks and determining noise

Hello , Im having one matrix which is product of two FFT transforms of one fits image ( astronomical image ). In that matrix you could find 3 peaks. One largest in center, and two around central ...
1k views

### Stone-Weierstrass theorem applied to Fourier series

This is a question on Fourier series convergence. The problem is, in the applications of the Stone Weierstrass approximation theorem on wikipedia, there's stated that as a consequence of the theorem ...
Given the coefficients $a_0,\ldots,a_N$, $b_1,\ldots,b_N$ of a real trigonometric polynomial: $f(x) = a_0 + \sum_{n=1}^N a_n \cos(nx) + \sum_{n=1}^N b_n \sin(nx)$ is there any efficient way to ...