I am working on a problem for which I need a 2d fft of a real
array, do some work on the tranformed array, solve some algebraic
equations for the key variables, and then perform the inverse
fft to form the updated variable [this is a incompressible flow
solver]. I am about to write the thing myself and thought I would
ask the community about fft routines before I make the final choices
on storage, real vs complex arrays, etc. The machine on which I will
be computing is an Origin2K running IRIX 6.5.xxx and using the
SGI MipsPro 7.2.x compilers.
My question: Does anyone know whether the fft routines that SGI
provides are in fact highly optimized? If not, what _is_ the best
fft routine you know about as far as speed is concerned? The vendor?
I also have access to a Cray T94 and thus have the same question
for that platform.
Of course, I am assuming that the SGI supplied fft routines are f90
routines, but quite frankly it looks as though this may not be the
case....I note that the man page for fft mentions fortran but not
fortran90 specifically. If these are fortran 77 but not fortran 90
routines, is there a problem?
Thanks for replies from those fft'ers who have some knowledge about
efficient f90 bindings, if these routines exist...
Comer Duncan
------------
Comer Duncan
Professor of Physics
Department of Physics and Astronomy
Bowling Green State University
Bowling Green, OH 43403
email: [log in to unmask]
phone: (419) 372 8108
fax:(419) 372 9938
------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|