.png){kind=icon}
.png){kind=icon}
Return
Efficient algorithms to compute Hankel transforms using wavelets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2008.07.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of the paper is to propose two efficient algorithms for the numerical evaluation of Hankel transform of order v, v > -1 using Legendre and rationalized Haar (RH) wavelets. The philosophy behind the algorithms is to replace the part xf (x) of the integrand by its wavelet decomposition obtained by using Legendre wavelets for the first algorithm and RH wavelets for the second one, thus representing F-v(y) as a Fourier-Bessel series with coefficients depending strongly oil the input function xf (x) ill both the cases. Numerical evaluations of test functions with known analytical Hankel transforms illustrate the proposed algorithms. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Bessel functions
Finite Hankel transform
Fourier-Bessel series
Legendre wavelets
Rationalized Haar wavelets
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W