Timeline for Minimal number of operations of a discrete Fourier transform
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2021 at 5:23 | comment | added | Arnold Neumaier | @skbmoore: FFTW uses specific FFTs for sizes $\le16$. But these are apparently optimized for many factors, not just for the operation count. | |
| May 22, 2021 at 5:21 | history | edited | Arnold Neumaier | CC BY-SA 4.0 |
added precision requirement
|
| May 21, 2021 at 20:43 | history | became hot network question | |||
| May 21, 2021 at 19:02 | history | edited | LSpice | CC BY-SA 4.0 |
Capitalise first word of title
|
| May 21, 2021 at 18:54 | answer | added | Steve Huntsman | timeline score: 6 | |
| May 21, 2021 at 16:20 | comment | added | skbmoore | Not an expert in this, but you might want to examine the wiki for 'Fastest Fourier Transform in the West.' Supposedly it is free to noncommercial users. A statement that seems to be relevant is '...FFTW uses hard-coded unrolled FFTs for these small sizes...' | |
| May 21, 2021 at 12:48 | history | edited | YCor |
edited tags
|
|
| May 21, 2021 at 12:45 | comment | added | Carlo Beenakker | This will depend on the precision you demand for the output, won't it? | |
| May 21, 2021 at 12:40 | history | asked | Arnold Neumaier | CC BY-SA 4.0 |