IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v386y2020ics0096300320304835.html
   My bibliography  Save this article

Asymptotics and numerical approximation of highly oscillatory Hilbert transforms

Author

Listed:
  • Xu, Zhenhua
  • Geng, Hongrui
  • Fang, Chunhua

Abstract

In this paper, we study asymptotics and fast computation of highly oscillatory Hilbert transforms ⨍0+∞f(x)x−τeiωxHν(1)(ωx)dx, where τ > 0 and f is analytic in the complex plane ℜ(z) ≥ 0, which may have an algebraic singularity at the point x=0. By analytic continuation, we first transform Hilbert transforms into the integrals on [0,+∞) with the integrands that don’t oscillate and decay exponentially, and then present the asymptotic behaviour about ω based on asymptotic expansion. For the computation of highly oscillatory Hilbert transforms, we present efficient numerical methods according to the position of τ. To be precise, we construct a Gaussian quadrature rule for it if τ=O(1) or τ ≥ 1. If 0 < τ ≪ 1, we rewrite it as a sum of three integrals, which can be efficiently evaluated by using Chebyshev approximation, Gauss–Laguerre quadrature rule and Meijer G–function. The effectiveness of the proposed methods are demonstrated by several numerical experiments.

Suggested Citation

  • Xu, Zhenhua & Geng, Hongrui & Fang, Chunhua, 2020. "Asymptotics and numerical approximation of highly oscillatory Hilbert transforms," Applied Mathematics and Computation, Elsevier, vol. 386(C).
  • Handle: RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304835
    DOI: 10.1016/j.amc.2020.125525
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320304835
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2020.125525?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Guidong & Xiang, Shuhuang, 2019. "Clenshaw–Curtis-type quadrature rule for hypersingular integrals with highly oscillatory kernels," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 251-267.
    2. Li, Bin & Xiang, Shuhuang, 2019. "Efficient methods for highly oscillatory integrals with weakly singular and hypersingular kernels," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Guidong & Xiang, Shuhuang, 2023. "An efficient quadrature rule for weakly and strongly singular integrals," Applied Mathematics and Computation, Elsevier, vol. 447(C).
    2. Kang, Hongchao & Wang, Ruoxia & Zhang, Meijuan & Xiang, Chunzhi, 2023. "Efficient and accurate quadrature methods of Fourier integrals with a special oscillator and weak singularities," Applied Mathematics and Computation, Elsevier, vol. 440(C).
    3. Li, Bin & Xiang, Shuhuang, 2019. "Efficient methods for highly oscillatory integrals with weakly singular and hypersingular kernels," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    4. SAIRA & Shuhuang Xiang & Guidong Liu, 2019. "Numerical Solution of the Cauchy-Type Singular Integral Equation with a Highly Oscillatory Kernel Function," Mathematics, MDPI, vol. 7(10), pages 1-11, September.
    5. SAIRA & Wen-Xiu Ma, 2022. "An Approximation Method to Compute Highly Oscillatory Singular Fredholm Integro-Differential Equations," Mathematics, MDPI, vol. 10(19), pages 1-16, October.
    6. Jianyu Wang & Chunhua Fang & Guifeng Zhang, 2023. "Multi-Effective Collocation Methods for Solving the Volterra Integral Equation with Highly Oscillatory Fourier Kernels," Mathematics, MDPI, vol. 11(20), pages 1-19, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304835. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.