On Fri, 1 Oct 1999, Steinar H. Gunderson wrote: > >In this way, two exponents could be tested using the same number of > >FFT/IFFT operations as is currently being used to test 1 exponent. > > Unless _I'm_ the one mixing up things here (very likely...), a possible > error might be that you're mixing DFT and FFT? Aren't those two different > algorithms? The FFT (Fast Fourier Transform) algorithm is simply a fast way of computing the DFT (Discrete Fourier Transform), so the two terms are interchangeable as far as I know. Sorry about the confusion. Mike _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
- Mersenne: Re: FFTW for GIMPS? EWMAYER
- Re: Mersenne: Re: FFTW for GIMPS? Guillermo Ballester Valor
- Re: Mersenne: Re: FFTW for GIMPS? Jason Stratos Papadopoulos
- Re: Mersenne: Re: FFTW for GIMPS? Guillermo Ballester Valor
- Re: Mersenne: Re: FFTW for GIM... Olivier Langlois
- Re: Mersenne: Re: FFTW fo... Jason Stratos Papadopoulos
- Mersenne: Possible id... Mike Bandsmer
- Mersenne: Re: Pos... Steinar H. Gunderson
- RE: Mersenne: Re:... Mike Bandsmer
- RE: Mersenne: Re: FFTW for GIMPS? Paul Leyland
- Mersenne: Re: FFTW for GIMPS? Steinar H. Gunderson
- Re: Mersenne: Re: FFTW for GIMPS? Guillermo Ballester Valor
- RE: Mersenne: Re: FFTW for GIMPS? Brian J. Beesley
- Mersenne: Re: FFTW for GIMPS? Steinar H. Gunderson
- Re: Mersenne: Re: FFTW for GIM... Pierre Abbat
- Mersenne: graphical interface for ... Spike Jones
- RE: Mersenne: Re: FFTW for GIMPS? Olivier Langlois
