[PYTHON MATRIX-SIG] 2D fft

[Rob.Hooft@embl-heidelberg.de]

>>>>> "JH" == Jim Hugunin writes:

 JH> def fft2d(x): 
 JH>     return fft(fft(x, axis=-1), axis=-2)

>>>>> "JC" == James Crotinger <jac@gandalf.llnl.gov> writes:

 JC> However, doing this in the above manner is not necessarily the
 JC> most efficient. Most multidimensional FFT routines put the
 JC> innermost loop over the number of vectors being transformed.

If the direction appears to make a big difference, you could put a
number of "physical transposes" in there to try and make it faster.

Rob.

-- 
=== Rob.Hooft@EMBL-Heidelberg.DE   http://www.Sander.EMBL-Heidelberg.DE/rob/ ==
==== In need of protein modeling?  http://www.Sander.EMBL-Heidelberg.DE/whatif/
Validation of protein structures?  http://biotech.EMBL-Heidelberg.DE:8400/ ====
== PGPid 0xFA19277D == Use Linux!  Free Software Rules The World! =============

=================
MATRIX-SIG  - SIG on Matrix Math for Python

send messages to: matrix-sig@python.org
administrivia to: matrix-sig-request@python.org
=================