Fast computation of singular oscillatory Fourier transforms (Q1725457)

From MaRDI portal
Revision as of 18:58, 12 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59043314, #quickstatements; #temporary_batch_1705082136280)
scientific article
Language Label Description Also known as
English
Fast computation of singular oscillatory Fourier transforms
scientific article

    Statements

    Fast computation of singular oscillatory Fourier transforms (English)
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: We consider the problem of the numerical evaluation of singular oscillatory Fourier transforms \( \int_a^b \left(x - a\right)^\alpha \left(b - x\right)^\beta f(x) e^{i \omega x} d x\), where \(\alpha > - 1\) and \(\beta > - 1\). Based on substituting the original interval of integration by the paths of steepest descent, if \(f\) is analytic in the complex region \(G\) containing \([a,b]\), the computation of integrals can be transformed into the problems of integrating two integrals on \([0, \infty)\) with the integrand that does not oscillate and decays exponentially fast, which can be efficiently computed by using the generalized Gauss Laguerre quadrature rule. The efficiency and the validity of the method are demonstrated by both numerical experiments and theoretical results. More importantly, the presented method in this paper is also a great improvement of a Filon-type method and a Clenshaw-Curtis-Filon-type method shown in [the first author and \textit{S. Xiang}, Appl. Math. Comput. 218, No. 7, 3553--3564 (2011; Zbl 1246.65045)] and the Chebyshev expansions method proposed in [the first author et al., J. Comput. Appl. Math. 242, 141--156 (2013; Zbl 1255.65073)], for computing the above integrals.
    0 references

    Identifiers