Hello,
I'd like to do an FFT of a moderately large 3D cube, 1024^3. Looking
at the run-time of smaller arrays, this is not a problem in terms of
compute time, but the array doesn't fit in memory. So, several
questions:
1) Numerical Recipes has an out-of-memory FFT algorithm, but looking
through
Argh. I could swear that yesterday I typed test cases just like the
one you provide, and it behaved correctly. Nevertheless, it clearly
fails in spite of my memory, so attached is a version which I believe
gives the correct behavior.
Greg
On Tue, Aug 5, 2008 at 9:00 AM, Robert Cimrman <[EMAIL P
I have two arrays of integers, and would like to know _where_ they
have elements in common, not just _which_ elements are in common.
This is because the entries in the integer array are aligned with
other arrays. This seems very close to what member1d advertises as
its function. However, member1d
