Computation of highly oscillatory integrals
using a Fourier extension approximation
Abstract.
The numerical evaluation of integrals of the form
is an important problem in scientific computing with significant applications in many branches of applied mathematics, science and engineering. The numerical approximation of such integrals using classical quadratures can be prohibitively expensive at high oscillation frequency () as the number of quadrature points needed for achieving a reasonable accuracy must grow proportionally to . To address this significant computational challenge, starting with Filon in 1930, several specialized quadratures have been developed to compute such oscillatory integrals efficiently. A crucial element in such Filon-type quadrature is the accurate evaluation of certain moments which poses a significant challenge when non-linear phase functions are involved.
In this paper, we propose an equispaced-grid Filon-type quadrature for computing such highly oscillatory integrals that utilizes a Fourier extension of the slowly varying envelope . This strategy is primarily aimed at significantly simplifying the moment calculations, even when the phase function has stationary points. Moreover, the proposed approach can also handle certain integrable singularities in the integrand. We analyze the scheme to theoretically establish high-order convergence rates. We also include a wide variety of numerical experiments, including oscillatory integrals with algebraic and logarithmic singularities, to demonstrate the performance of the quadrature.
Key words and phrases:
oscillatory integrals, integrable singularities, Fourier extension, Filon quadrature1. Introduction
The evaluation of highly oscillatory integrals plays a significant role in many branches of applied mathematics. The accuracy of their numerical approximation using a classical quadrature suffers significantly when the oscillation frequency is much more than the number of quadrature points. Since the initial attempt by Filon [1] to solve this difficulty, numerous approaches have been developed [2, 3, 4, 5, 6]. The Filon quadrature for approximating the integral of the form
(1) |
relies on the interpolating polynomial satisfying for interpolation nodes to obtain the approximation
(2) |
Both the Filon method and its generalisation [2, 3, 4] where is approximated by splines, are shown to be efficient for suitably smooth functions provided the moments can be explicitly calculated. While obtaining these moments is easy for linear oscillators, that is, , in general, the accurate moment calculations pose a significant challenge. For example, The Filon-Clenshaw-Curtis quadrature [7], that uses as nodes and Chebyshev approximations for , obtain the underlying moments recursively using multiple recurrence relations. The Filon-Clenshaw-Curtis and its variations [8, 9, 10, 11] have been developed to efficiently handle integrable algebraic and logarithmic singularities in the integrand.
Several Filon-like approaches use the change of variable to transform the integral to the one with linear oscillations
(3) |
under the assumption that for all or for all . Indeed, if has finitely many zeros in , say , then, by setting and , we have
where, for each , the integral over can be transformed into the one with linear oscillations.
In this paper, we propose a Filon-type quadrature for oscillatory integrals with equispaced quadrature nodes. We show that this approach not only handles algebraic and logarithmic singularities in the integrand but also significantly simplifies the solution of the underlying moment problem. In fact, for several special singular weights, the proposed approach yields moment problems that can be solved analytically. Moreover, our approach requires only discrete functional data on a uniform grid. The fact that approximating the integral to high order does not require explicit knowledge of the derivatives is a significant strength of this approach.
The method to yield a more tractable moment problem relies on the interpolating trigonometric polynomial approximation of the smooth non-oscillatory part of the integrand. However, in general, such an approximation is inflicted with Gibb’s oscillations that manifest due to the discontinuous periodic extension of the function being approximated. To overcome this difficulty, we first construct a periodic extension of the function, which is then approximated by the interpolating trigonometric polynomial using FFT. We discuss the periodic extension employed in the paper in section 2.2. In section 2.4, we delve into the moment problem and discuss the solution of several important instances. In section 3, we present a convergence analysis. A variety of numerical experiments are presented in section 4 to demonstrate the performance of the proposed quadrature.
2. Methodology
Motivated by the need to compute the integrals such as those that appear on the right-hand side of the eq. 3, we consider the problem of approximation of the integrals
(4) |
where is the weight function and is a smooth function on .
2.1. The basic idea
For clarity, we introduce the main ideas assuming that the is known everywhere in the interval and its derivatives are available at and . At the heart of this procedure is the step where we approximate by a trigonometric polynomial
of period . The primary motivation for doing so is to simplify the underlying moment calculations. Indeed, we see that
(5) |
where
(6) |
For many important weights , the moments can be obtained analytically as we see later in section 2.4.
The natural choice for the approximating trigonometric polynomial of is to use its truncated Fourier series. However, if we use the period , it fails to converge uniformly if the -periodic extension of is discontinuous, that is, if , due to Gibb’s phenomenon. Instead of directly approximating , we utilize the Fourier series of a periodic function with a larger period that coincides with on the interval to eliminate Gibb’s oscillations. In the next sub-section, we discuss one such construction that we use for numerical experiments in this paper.
2.2. A periodic extension:
Among several possible periodic extensions for a given function, for simplicity of implementation and analysis, we utilize the construction based on the two-point Hermite polynomial [12, 13]. Given on , we introduce a periodic function of period given by
(7) |
where the polynomial is chosen as
(8) |
with
2.3. The Discrete Problem:
In many practical applications, only discrete functional data is available. In this regard, we consider the equispaced grid of size on the interval with grid points where the functional data is assumed to be available. We introduce the grid function given as
(9) |
where
(10) |
for , the operators and respectively denote the forward and backward finite difference derivative operators for approximating of the form
with appropriately chosen constants so that the order of accuracy is . The discrete Fourier coefficients are obtained as
(11) |
for . Finally, the integration scheme for approximation of is given by
(12) |
2.4. The moment problem:
The numerical integration scheme requires obtaining the moments given by
The following are solutions to some instances of the moment problem corresponding to important classes of weights of interest.
Example 2.1.
For the simplest case where , we have
Example 2.2.
For one sided algebraic singularity where , the moments are given by
Example 2.3.
For with , the weak algebraic singularity at both end-points of the same order , we have
provided , whereas
if . In particular, for , we get
Example 2.4.
For , for , when the singularity is present at both end-points with different exponents, then
Example 2.5.
For , when the logarithmic singularity is present at the left end-point, then
if and otherwise.
3. Error Analysis
We begin by noting that, using the Fourier series of the periodic extension of , that is,
where
the exact integral can be expressed as
The error in the numerical integration, therefore, is given by
(13) |
Using
we rewrite the second summation in eq. 13 as
(14) |
and, therefore, combining the expressions in eq. 13 and eq. 14, the error reads
(15) |
To see that
(16) |
we introduce
where is the -periodic function with for and for . As
we have
Therefore, using eq. 16, and after simplification, the error in section 3 is expressed as
(17) |
Thus, to obtain an error bound, we need an estimate on . In this direction, it is important to note that where for , and . Thus, for , we have
(18) |
and
(19) | ||||
Therefore, using eq. 18 and eq. 19, we conclude that there exits a positive constant such that
(20) |
Finally, combining eq. 17 and eq. 20, we have
(21) |
We, therefore, see that the convergence rate for the approximations does depend on the weight function . In this context, using the notation
we introduce a class of weight functions defined as
for which the approximations converge at the same rate for a given . Obviously, for . The numerical calculations plotted in fig. 1 indicate that the the weight belongs to whereas belongs to with .
The following theorem captures the essence of the error analysis of the proposed integration scheme.




Theorem 3.1.
Let and . Let
where
be the approximation to the oscillatory integral . Then, there exist and a constant such that
for all .
The optimal choice is, therefore, recommended in practice for approximating the derivatives that results in order rate of convergence for integral approximations.
4. Numerical Results
In this section, we present a variety of numerical experiments to validate the performance of the proposed method. Unless otherwise stated, we use in quadrature approximations.
Example 4.1.
To begin with, we test our method on an example used by David Levin in [14] and consider the integral
The change of variable yields where
is smooth on the interval . Thus, the quadrature with weight function produces rapidly convergent approximations of where the convergence rate can be raised arbitrarily by increasing the parameter . We studied the convergence at , and for and presented the results in fig. 2 where we plot against to gauge the speed of convergence through the slope of respective lines. The plots clearly show that approximations converge with the rate .



Example 4.2.
For studying the convergence behaviour of the numerical integration scheme on a second example without any singularity, that is, , we consider the integral
The results in fig. 3 show that the order of convergence does not degrade with increasing oscillation frequency.



Example 4.3.
For the next example, we consider the integral
that has been studied in literature for measuring the performance of quadratures in dealing with end-point algebraic singularities. For instance, the results for this example is discussed in [15] where, for and , a relative error of the order is achieved with . For and , a relative error of is obtained with . Approximations to these integrals using Filon-Clenshaw-Curtis have also been reported in [8] for and under experiment 1. Our approach, by construction, captures these integrals exactly upto the machine precision through analytic moment computations as seen in table 1 where we report the errors for and . The results shown are for and .
Example 4.4.
Next, we study the performance of our method in approximating the integral
Using the change of variable , we have
where we have an algebraic singularity of order at the upper end point of the integration interval. Moreover, the function is smooth on . The results in fig. 4 show that the approximations convergence at the expected rate .



Example 4.5.
For the following integral
where is only piecewise smooth, high-order approximation can still be obtained by breaking the integral appropriately as seen in the results reported in fig. 8 where numerical integrals exhibit the convergence rate .



Example 4.6.
We now consider an integral with a weight of the form . In particular, we approximate the following integral
using the proposed scheme for and . The convergence rates for , shown in fig. 6, are consistent with the theoretical rate .



The the results for a second integral of this type
presented in fig. 7, confirm the convergence rates.



Example 4.7.
Finally, we study the performance of the proposed method in approximating the following integral
that has a logarithmic singularity at . As in 4.4, using the change of variable , yields a linear oscillator
where and is smooth on .



5. Conclusion
In this paper, we introduce a new Filon-type quadrature for numerical of highly oscillatory integrals of the form eq. 4 that can be employed to approximate more general oscillatory integrals of the form eq. 1 with algebraic singularities and stationary points. The proposed method utilises an interpolating trigonometric polynomial to approximate the smooth and non-oscillatory part of the integrand. Normally, when a function is not periodic, such trigonometric polynomial approximations suffer from the Gibb’s phenomenon. In order that the unwanted Gibb’s oscillations do not adversely impact the accuracy of numerical integration, the method constructs a periodic extension of the underlying function before its approximation. The main advantage of using trigonometric interpolation lies in obtaining a relatively simpler moment problem that can be solved analytically for many important classes of integrands. This approach can easily handle one and two sided integrable algebraic singularities as well as logarithmic singularities, The accompanying numerical analysis of the method reveals that the approximations converge rapidly to the exact integral. The scheme is tested on a variety of highly oscillatory integrals and these numerical experiments confirm that the approximations converge at the rates predicted by the theory.
References
- [1] L. N. G. Filon, Iii.—on a quadrature formula for trigonometric integrals, Proceedings of the Royal Society of Edinburgh 49 (1930) 38–47.
- [2] Y. L. Luke, On the computation of oscillatory integrals, in: Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 50, Cambridge University Press, 1954, pp. 269–277.
- [3] E. Flinn, A modification of filon’s method of numerical integration, Journal of the ACM (JACM) 7 (2) (1960) 181–184.
- [4] E. Tuck, A simple “filon-trapezoidal” rule, Mathematics of Computation 21 (98) (1967) 239–241.
- [5] A. Iserles, On the numerical quadrature of highly-oscillating integrals i: Fourier transforms, IMA Journal of Numerical Analysis 24 (3) (2004) 365–391.
- [6] A. Iserles, S. Nørsett, On quadrature methods for highly oscillatory integrals and their implementations, Tech. rep. (2004).
- [7] V. Dominguez, I. Graham, V. Smyshlyaev, Stability and error estimates for filon–clenshaw–curtis rules for highly oscillatory integrals, IMA journal of numerical analysis 31 (4) (2011) 1253–1280.
- [8] V. Dominguez, I. G. Graham, T. Kim, Filon–clenshaw–curtis rules for highly oscillatory integrals with algebraic singularities and stationary points, SIAM Journal on Numerical Analysis 51 (3) (2013) 1542–1566.
- [9] V. Domínguez, Filon–clenshaw–curtis rules for a class of highly-oscillatory integrals with logarithmic singularities, Journal of computational and applied mathematics 261 (2014) 299–319.
- [10] B. Li, S. Xiang, Efficient methods for highly oscillatory integrals with weakly singular and hypersingular kernels, Applied Mathematics and Computation 362 (2019) 124499.
- [11] H. Kang, S. Xiang, Efficient integration for a class of highly oscillatory integrals, Applied Mathematics and Computation 218 (7) (2011) 3553–3564.
- [12] A. Anand, A. K. Tiwari, A fourier extension based numerical integration scheme for fast and high-order approximation of convolutions with weakly singular kernels, SIAM Journal on Scientific Computing 41 (5) (2019) A2772–A2794.
- [13] D. Huybrechs, S. Vandewalle, On the evaluation of highly oscillatory integrals by analytic continuation, SIAM Journal on Numerical Analysis 44 (3) (2006) 1026–1048.
- [14] D. Levin, Procedures for computing one-and two-dimensional integrals of functions with rapid irregular oscillations, Mathematics of Computation 38 (158) (1982) 531–538.
- [15] S. Zaman, et al., New quadrature rules for highly oscillatory integrals with stationary points, Journal of Computational and Applied Mathematics 278 (2015) 75–89.