Stéphane,
Thanks. I think I get the idea: log(1+x) allows values much closer to 1
than possible with log(x) because x could fall down way below %eps,
since the full folating point range for small values would be available
(about 1e-323).
But then the same would be true for any function
Hi Fredrico,
See the discussion @
https://stackoverflow.com/questions/52736011/instruction-fyl2xp1
here is a relevant excerpt:
The Taylor series for log(x) is usually done about x = 1. So every term will
have x - 1. If you're trying to compute log(x + 1) for a very small x, a direct
call as
Dear all,
I was comparing the accuracy of FFT and two exact formulas for the FFT
of a complex exponential and I was first surprised by a relative
accuracy of only 10^-13 for N = 4096, but on second thought it may be
related to arithmetic errors due to about N*log2(N) sums and products.
But
