For Programmers: Free Programming Magazines  


Home > Archive > Fortran > April 2007 > Re: fft from numerical recipes









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author Re: fft from numerical recipes
Jon Harrop

2007-04-18, 7:05 pm

heiko liebhart wrote:
> i am quite as new to programming in general and to fortran in particular
> as to programming ffts.
>
> as i wanted to apply a fouriertransformation to one of my progs for
> pulseshaping i started with the subroutine four1 provided in numerical
> recipes.


Forget about Fortran and NR, they both suck. Use something like Mathematica,
Matlab, R, F# or OCaml and you won't suffer from unnecessary problems. If
you must use an unsafe low-level language use C and the FFTW library from
MIT.

--
Dr Jon D Harrop, Flying Frog Consultancy
The F#.NET Journal
http://www.ffconsultancy.com/produc...journal/?usenet
gps

2007-04-18, 7:05 pm

Jon Harrop wrote:
>
>
> Forget about Fortran and NR, they both suck. Use something like Mathematica,
> Matlab, R, F# or OCaml and you won't suffer from unnecessary problems. If
> you must use an unsafe low-level language use C and the FFTW library from MIT.


A leaping frog squirt at its finest, what do you think is beneath the
covers of those safeways of yours? But, if you actually knew something
useful you could have suggested any number of places housing FFTs eons
before your newbies shed their diapers, say

Singleton, 1968
http://www.netlib.org/go/fft.f

Jon Harrop

2007-04-19, 4:08 am

gps wrote:
> A leaping frog squirt at its finest, what do you think is beneath the
> covers of those safeways of yours? But, if you actually knew something
> useful you could have suggested any number of places housing FFTs eons
> before your newbies shed their diapers, say
>
> Singleton, 1968
> http://www.netlib.org/go/fft.f


Is it O(log n) for all "n"? Does it give O(sqrt(log n)) error for all "n"?

No. In fact it will die if you give it an array with a length that has a
prime factor above 23. So your code sucks. Ditch it. Stop citing stuff from
the 60's and pretending it is up to date. Use FFTW. No headache...

--
Dr Jon D Harrop, Flying Frog Consultancy
The F#.NET Journal
http://www.ffconsultancy.com/produc...journal/?usenet
Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2008 codecomments.com