Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #5492

FFT Speed

From to <todummy@gmail.com>
Newsgroups comp.soft-sys.math.mathematica
Subject FFT Speed
Date 2011-10-07 09:01 +0000
Organization Steven M. Christensen and Associates, Inc and MathTensor, Inc.
Message-ID <j6mf50$7hu$1@smc.vnet.net> (permalink)

Show all headers | View raw


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.

Back to comp.soft-sys.math.mathematica | Previous | Next — Next in thread | Find similar | Unroll thread


Thread

FFT Speed to <todummy@gmail.com> - 2011-10-07 09:01 +0000
  Re: FFT Speed roby <roby.nowak@gmail.com> - 2011-10-08 18:38 +0000
  Re: FFT Speed Rui <rui.rojo@gmail.com> - 2011-10-08 18:45 +0000

csiph-web