Go Back > Great Internet Mersenne Prime Search > Software

Thread Tools
Old 2011-01-06, 20:11   #1
nuggetprime's Avatar
Mar 2007

2·151 Posts
Default Quickest fft library

Just courios,what is the quickest portable fft library for double-precision real 1 d transforms?
I read somewhere it was djbfft but is it still the fastest?
nuggetprime is offline   Reply With Quote
Old 2011-01-06, 21:09   #2
bsquared's Avatar
Feb 2007

357810 Posts

I had always thought it was FFTW.
bsquared is offline   Reply With Quote
Old 2011-01-08, 21:29   #3
Just call me Henry
henryzz's Avatar
Sep 2007
Cambridge (GMT/BST)

2·32·7·47 Posts

Originally Posted by bsquared View Post
I had always thought it was FFTW.
Does anyone know how fast this is in comparison with GWnum?
henryzz is offline   Reply With Quote
Old 2011-01-09, 01:24   #4
Tribal Bullet
jasonp's Avatar
Oct 2004

3×1,181 Posts

You can explore their benchmark page.

djbfft is very fast if you have a 12 year old computer; he hasn't updated it in a long time, and it never supported longer FFT lengths.

Last fiddled with by jasonp on 2011-01-09 at 01:24
jasonp is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime numbers library Martin Lounge 12 2017-12-02 17:18
Using YAFU as a C-library LangerJan YAFU 2 2013-02-17 06:18
factoring with MIRACL library prss Factoring 22 2011-06-15 20:25
GWNUM library and llr leizhoucn Programming 2 2007-11-05 09:34
GWNUM library bearnol Software 6 2006-02-24 11:19

All times are UTC. The time now is 20:58.

Mon Oct 25 20:58:08 UTC 2021 up 94 days, 15:27, 0 users, load averages: 2.34, 2.15, 2.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.