All Questions

Filter by
Sorted by
Tagged with
2
votes
1answer
93 views

Slow execution in Fourier analysis [closed]

The following example executes and plots a Fourier transform of a integrable function. Can anyone suggests why the execution is so slow (about 1 min on a laptop Intel(R) Core(TM) i7-4600U CPU @ 2....
1
vote
0answers
30 views

A newbie question about the use of the FourierSeries functions

Although I have had no previous experience with the Mathematica Fourier Series functions ( or package ), I am writing a tutorial on Fourier Analysis and Transformations in a Mathematica Notebook, ...
1
vote
0answers
65 views

Fourier transform calculation never stops [closed]

I'm trying to calculate a Fourier transform and plot it, however the calculation is running for several hours now. I suspect that there is a mistake in my script. Or am I just not patient enough? Is ...
3
votes
2answers
167 views

How to make this higher resolution transform as fast as Fourier?

Given a table of data, the Fourier command gives the discrete frequency content of the data, where the resolution in frequency space is equal to 1/N, where N is the number of data points. Higher ...
0
votes
1answer
115 views

Compute fourier transform of huge list of functions faster [closed]

I want to compute the Fourier transform in the form of trigonometric functions from a list of functions. Suppose I have F1 like below: ...
0
votes
0answers
67 views

(Naive) Manual implementation of DFT results in long sum which is very inefficient to plot, can my approach be saved?

I will do my best to keep this question as short as possible, I am afraid though that I wont be able to get my issue across if I don't elaborate on the background and provide my code as an example. ...
2
votes
0answers
101 views

FourierCoefficient performance

I encountered weird performance issue while using FourierCoefficient[]. I narrowed it down to calculating $n$-th coefficient for $\cos(nx)$. ...
2
votes
1answer
66 views

NIntegrate option for FourierSeries

I would like to use FourierSeries but it is very slow. My guess is that it is because it uses symbolic integration: ...
3
votes
1answer
436 views

2D Fourier transform of a few (4) disjoint discs on a plane

I'd really appreciate some advice. Short Version I'm trying to calculate the following $$ \psi(X,Y,z=d)=\underset{aperature}{\iint}\psi(x,y,z=0)e^{-i\frac{k}{d}\left(xX+yY\right)}dxdy\\\psi(x,y,z=0)=...
5
votes
0answers
163 views

Why does setting $Assumptions make my Fourier transforms slow?

Consider these Fourier transforms ...
7
votes
1answer
1k views

Speeding up numerical Fourier Transform

I wrote this function NFourierTransform, which takes a function $f(k)$ and numerically calculates the fourier transform integral for discrete values of $k \in [k_{\...
8
votes
2answers
250 views

Speed up Fourier for Booleans

I'm calculating a bit of the power spectrum of a two color cellular automaton using: ...
13
votes
2answers
369 views

Parallelization of distinct array write access from subkernels

I'm working on an implementation of a multivariate FFT, which is (or at least should be) highly parallelizable due to the row-column-algorithm. However, i can't figure out how to implement that. The ...