Answers are grounded in this paper and cite their sources.
In this paper a method is presented for evaluating \[ ∫ _0^N {f(x){eⁱʷˣ}} dx{ where }ω N = p · 2π ,{ }p{ integer}{.}\] The idea is to approximate $f(x)$ instead of the whole integrand by aid of polynomials. The Romberg-Stiefel algorithm has been extended to this case. The new method is complementary to the usual Romberg-Stiefel algorithm in the sense that it is more advantageous for larger values of ω. An expression for the remainder term is also included. Results for the real part are exact if $f(x)$ is of at most 7th degree and for the imaginary part if $f(x)$ is of at most 8th degree.
No takes yet. Share an insight, caveat, or question.
Vooren et al. (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: