diff options
| author | Martin Reinecke <martin@mpa-garching.mpg.de> | 2018-12-25 21:39:07 +0100 |
|---|---|---|
| committer | Martin Reinecke <martin@mpa-garching.mpg.de> | 2018-12-25 21:39:07 +0100 |
| commit | 0fe2a58c4434d7ee4e08f732e207c631bab6bc75 (patch) | |
| tree | de2ec788fa66c168f56128c2268ed62bac8e72ec | |
| parent | 062dc8f831e695c2c179482da35affcc6045b4f3 (diff) | |
| download | numpy-0fe2a58c4434d7ee4e08f732e207c631bab6bc75.tar.gz | |
add release notes
| -rw-r--r-- | doc/release/1.17.0-notes.rst | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/doc/release/1.17.0-notes.rst b/doc/release/1.17.0-notes.rst index ec6f63945..5c58632c0 100644 --- a/doc/release/1.17.0-notes.rst +++ b/doc/release/1.17.0-notes.rst @@ -6,6 +6,7 @@ NumPy 1.17.0 Release Notes Highlights ========== +* NumPy's FFT implementation has switched to pocketfft New functions ============= @@ -38,6 +39,15 @@ New Features Improvements ============ +replacement of the `fftpack`-based FFT module by the `pocketfft` library +------------------------------------------------------------------------ +Both implementations have the same ancestor (Fortran77 `FFTPACK` by Paul N. +Swarztrauber), but `pocketfft` contains additional modifications which +improve both accuracy and performance in some circumstances. For FFT lengths +containing large prime factors, `pocketfft` uses Bluestein's algorithm, which +maintains `O(N log N)` run time complexity instead of deteriorating towards +`O(N*N)` for prime lengths. Also, accuracy for real-valued FFTs with near-prime +lengths has improved and is on par with complex-valued FFTs. Changes ======= |