Linux evo.fastest-server.com 5.14.0-284.1101.el9.tuxcare.11.els11.x86_64 #1 SMP PREEMPT_DYNAMIC Fri Aug 14 13:30:35 UTC 2026 x86_64
LiteSpeed
Server IP : 103.249.112.113 & Your IP : 216.73.217.135
Domains : 988 Domain
User : tanishks
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
doc /
fftw-libs-double /
Delete
Unzip
Name
Size
Permission
Date
Action
AUTHORS
585
B
-rw-r--r--
2018-05-24 12:03
ChangeLog
601.47
KB
-rw-r--r--
2018-05-24 12:03
NEWS
23.15
KB
-rw-r--r--
2018-05-24 12:03
README
1.89
KB
-rw-r--r--
2018-05-24 12:03
README-perfcnt.md
3.7
KB
-rw-r--r--
2018-05-24 12:03
TODO
1.31
KB
-rw-r--r--
2018-05-24 12:03
Save
Rename
TODO before FFTW-$2\pi$: * figure out how to autodetect NEON at runtime * figure out the arm cycle counter business * Wisdom: make it clear that it is specific to the exact fftw version and configuration. Report error codes when reading wisdom. Maybe have multiple system wisdom files, one per version? * DCT/DST codelets? which kinds? * investigate the addition-chain trig computation * I can't believe that there isn't a closed form for the omega array in Rader. * convolution problem type(s) * Explore the idea of having n < 0 in tensors, possibly to mean inverse DFT. * better estimator: possibly, let "other" cost be coef * n, where coef is a per-solver constant determined via some big numerical optimization/fit. * vector radix, multidimensional codelets * it may be a good idea to unify all those little loops that do copying, (X[i], X[n-i]) <- (X[i] + X[n-i], X[i] - X[n-i]), and multiplication of vectors by twiddle factors. * Pruned FFTs (basically, a vecloop that skips zeros). * Try FFTPACK-style back-and-forth (Stockham) FFT. (We tried this a few years ago and it was slower, but perhaps matters have changed.) * Generate assembly directly for more processors, or maybe fork gcc. =) * ensure that threaded solvers generate (block_size % 4 == 0) to allow SIMD to be used. * memoize triggen.