diff --git a/content/numerical/FastFourierTransform.h b/content/numerical/FastFourierTransform.h index 7da5b51085ff8f1c82d73e5183dc36b63e25990a..8986fec008b83214d8ccb5717c4525153bcccc53 100644 --- a/content/numerical/FastFourierTransform.h +++ b/content/numerical/FastFourierTransform.h @@ -13,6 +13,8 @@ Otherwise, use long doubles/NTT/FFTMod. * Time: O(N \log N) with $N = |A|+|B|$ ($\tilde 1s$ for $N=2^{22}$) * Status: somewhat tested + * Details: An in-depth examination of precision for both FFT and FFTMod can be found + * here (https://github.com/simonlindholm/fft-precision/blob/master/fft-precision.md) */ #pragma once diff --git a/content/numerical/FastFourierTransformMod.h b/content/numerical/FastFourierTransformMod.h index c2b680546844716299dfa59f4d6b6450c396c621..0208a85dddeef25192cca710cab071042bb95f32 100644 --- a/content/numerical/FastFourierTransformMod.h +++ b/content/numerical/FastFourierTransformMod.h @@ -8,6 +8,8 @@ * Inputs must be in $[0, \text{mod})$. * Time: O(N \log N), where $N = |A|+|B|$ (twice as slow as NTT or FFT) * Status: stress-tested + * Details: An in-depth examination of precision for both FFT and FFTMod can be found + * here (https://github.com/simonlindholm/fft-precision/blob/master/fft-precision.md) */ #pragma once