Asymptotic analysis of numerical steepest descent with path approximations (Q604683): Difference between revisions

The authors study Fourier-type highly oscillatory integrals \[ I[f] = \int_{-1}^1 f(x) e^{i\omega g(x)} \,dx, \] where \(\omega\) is a large parameter, \(f(x)\), \(g(x)\) are smooth functions. The numerical method of steepest descent for oscillatory integrals using a low-cost explicit polynomial approximation of the paths of steepest descent is proposed. A disadvantage of this approach is that the method is asymptotic. It is to be noted that in many cases it is sufficient to have only a rough approximation of the exact steepest-descent path. The proposed scheme requires the computation of derivatives, which may not always be available. This is the case for most numerical schemes for oscillatory integrals with high asymptotic order, because the asymptotic behaviour of the integral depends precisely on those derivatives. However, when aiming for a high asymptotic order, it is sufficient to know the derivatives only approximately, as long as the accuracy of the approximation scales with \(\omega\) in a suitable fashion. Results regarding the asymptotic error behaviour are formulated in a theorem and have confirmed using the numerical experiments.