.png){kind=icon}
.png){kind=icon}
Return
Numerical steepest descent method for computing oscillatory-type Bessel integral transforms☆
.png){kind=icon}
PRE
AI
DOI：10.1016/j.matcom.2025.04.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, numerical steepest descent method is implemented to approximate highly oscillatory Bessel-type integral transforms. We begin our analysis by utilizing an important relationship between Bessel function of the first kind and modified Bessel function of the second kind. Subsequently, we transform new integrals into the forms on the interval [0, +infinity), where the integrands do not oscillate and decay exponentially fast. These integrals can then be efficiently computed using Gauss-Laguerre quadrature rule. Furthermore, we derive the theoretical error estimates that depend on the frequency w and the number of nodes n. Numerical examples based on the theoretical results are provided to demonstrate the effectiveness of these methods.
Keywords:
Bessel function
Oscillatory integrals
Steepest descent method
Numerical integration
Journal
IF:
4.4
Papers:
784
Citations:
1.0W
Organization
No organization information available