Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.

Re: Fast Fourier Transform in Multiple Dimensions

by Helter (Chaplain)
on Oct 08, 2002 at 15:53 UTC ( [id://203676]=note: print w/replies, xml ) Need Help??

in reply to Fast Fourier Transform in Multiple Dimensions

You may have seen this already, but cpan does have a fft module: math::fft.
From what I saw it only handles a single array, and I don't remember much of the tiny bit I learned about fft in school...but it might be easier to use those as a base and build up to multiple dimensions.....
Or if it's possible to flatten the data, I don't recall.

Just me flailing about :)
  • Comment on Re: Fast Fourier Transform in Multiple Dimensions

Replies are listed 'Best First'.
Re: Re: Fast Fourier Transform in Multiple Dimensions
by enigmae (Pilgrim) on Oct 08, 2002 at 16:01 UTC
    Math::FFT is the module that I noticed, but it doesn't support multiple dimensions. I have a tendency to reinvent the wheel, but before I do I just wanted to make sure someone out there hasn't been doing this type of application in perl.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://203676]
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others admiring the Monastery: (6)
As of 2024-06-24 08:53 GMT
Find Nodes?
    Voting Booth?

    No recent polls found

    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.