Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Fast Fourier Transform in Multiple Dimensions

by fglock (Vicar)
on Oct 08, 2002 at 16:32 UTC ( [id://203685]=note: print w/replies, xml ) Need Help??


in reply to Fast Fourier Transform in Multiple Dimensions

PDL::FFT - These work for arrays of any dimension, although ones with small prime factors are likely to be the quickest.

  • Comment on Re: Fast Fourier Transform in Multiple Dimensions

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (2)
As of 2025-06-22 00:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.