Error analysis for Fourier series evaluation
A. C. R. Newbery · Mathematics of Computation · 1973
A floating-point error analysis is given for the standard recursive method of evaluating trigonometric polynomials. It is shown that, by introducing a phase-shift, one can hold the error growth down to an essentially linear function of the degree. Explicit computable error bounds are derived and numerically verified.