2020
DOI: 10.1016/j.jmaa.2019.123640
|View full text |Cite
|
Sign up to set email alerts
|

A unified framework for asymptotic analysis and computation of finite Hankel transform

Abstract: In this paper we present a unified framework for asymptotic analysis and computation of the finite Hankel transform. This framework enables us to derive asymptotic expansions of the transform, including the cases where the oscillator has zeros and stationary points. As a consequence, two efficient and affordable methods for computing the transform numerically are developed and a detailed analysis of their asymptotic error estimate is carried out. Numerical examples are provided to confirm our analysis.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 34 publications
(45 reference statements)
0
3
0
Order By: Relevance
“…This fundamental concept underwent further refinement by Iserles and Nørsett [5], who made a significant advancement by recognizing that the asymptotic expansion of b a f (x)e iωx dx solely depends on the values and derivatives of f (x) evaluated at the endpoints. Recently, this strategic approach has been extended to a broader spectrum of highly oscillatory integrals, including those with Besseltype kernels [16,20].…”
Section: The Filon-type Methods For I 1 [ F ]mentioning
confidence: 99%
“…This fundamental concept underwent further refinement by Iserles and Nørsett [5], who made a significant advancement by recognizing that the asymptotic expansion of b a f (x)e iωx dx solely depends on the values and derivatives of f (x) evaluated at the endpoints. Recently, this strategic approach has been extended to a broader spectrum of highly oscillatory integrals, including those with Besseltype kernels [16,20].…”
Section: The Filon-type Methods For I 1 [ F ]mentioning
confidence: 99%
“…In the following tables, we make a comparison between the proposed method and the modified Filon-type method developed in [19]. Here, the multiplicity ℓ = 1 implies that we use Lagrange interpolation at the interpolation point.…”
Section: The Comparison With the Modified Filon-type Methodsmentioning
confidence: 99%
“…Regarding the computation of (1.1) with a special irregular oscillator and a = 0, Xiang and Wang in [25] first studied and gave an efficient Filon-type method by diffeomorphism transform for the special case g(a) = g ′ (a) = • • • = g (r) (a) = 0. Recently, Wang in [19] further comprehensively studied, provided asymptotic analysis and proposed the modified Filon-type method for computing (1.1) with the general oscillator g(x). It can achieve the higher accuracy by either adding derivatives at the critical points (including zeros, end points and stationary points) or increasing the number of interpolation nodes.…”
Section: Introductionmentioning
confidence: 99%