.png){kind=icon}
.png){kind=icon}
Return
An improved method for computing Hankel transform
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2008.07.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose of this paper is to compute the Hankel transform F-n(y) of order n of a function f(x) and its inverse transform using rationalized Haar wavelets. The integrand root xf(x) is replaced by its wavelet decomposition. Thus representing F-n(y) as a Fourier-Bessel series with coefficients depending strongly on the local behavior of the function root xf(x), thereby getting an efficient algorithm for their numerical evaluation. Numerical evaluations of test functions with known analytical Hankel transforms illustrate the proposed algorithm. (C) 2008 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keywords:
Bessel functions
Finite Hankel transform
Fourier-Bessel series
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
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W