MathGroup Archive 1997

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

Search the Archive

Q: why is 2D-FFT incredibly slow in Mma3.0 ??

I'm trying to do 2D Fast Fourier Transforms using Fourier[] in Mma v3.0
running on a 120MHz Macintosh.  My arrays are reals, 256 x 256.  Why does
this take ~ tens of seconds?

How can I speed things up?  Will compliation in Mma help?  Wolfram
techsupport says it won't.

Where can I see concrete examples or tutorials on the creation of
externals C code for compilation under CodeWarrior (v10 or v11) and that
are called by Mma?  I don't look forward to learning the down and dirty of
how to do this without some guidance?

Any help or suggestions most welcome.


Bill Christens-Barry

  • Prev by Date: Re: arguments in functions
  • Next by Date: (Q:) ReplacePart + SubMatrix replacement
  • Previous by thread: Re: arguments in functions
  • Next by thread: (Q:) ReplacePart + SubMatrix replacement