MathGroup Archive 2011

[Date Index] [Thread Index] [Author Index]

Search the Archive

FFT Speed

  • To: mathgroup at
  • Subject: [mg121961] FFT Speed
  • From: to <todummy at>
  • Date: Fri, 7 Oct 2011 04:48:40 -0400 (EDT)
  • Delivered-to:

I have a 3D matrix with dimensions {355,647,8}.  For each {x,y} I need
to compute the FFT along the z dimension, i.e. 355*647 FFTs of 8
elements each.  The fastest way I found to do this was

Partition[Map[Fourier[#, FourierParameters -> {1, -1}] &,
Flatten[data, 1]], dimx];

I was wondering if there are faster ways to do this.  The reason I ask
is because another package for numerical computations can do this a
lot faster compared to my solution (nearly two orders of magnitude
faster !)

I tried using ParallelMap but this makes things even slower.

  • Follow-Ups:
  • Prev by Date: ParallelMap in FindMinimum getting slower
  • Next by Date: Re: A variable defaulting to a previous variable?
  • Previous by thread: Re: ParallelMap in FindMinimum getting slower
  • Next by thread: Re: FFT Speed