The Hankel transform for sequences (defined below) has attracted an increasing amount of attention in recent years. The paper [4] situated its study within the mainstream of research into integer sequences, while papers such as [2] hinted at how the study of certain Hankel transforms can lead to results concerning classical sequences. That paper exploited a link between continued fractions and ...

The Hankel transform of a function by means of a direct Mellin approach requires sampling on an exponential grid, which has the disadvantage of coarsely undersampling the tail of the function. A novel modified Hankel transform procedure, not requiring exponential sampling, is presented. The algorithm proceeds via a three-step Mellin approach to yield a decomposition of the Hankel transform into...

 sinx x if x 6= 0 1 otherwise This function is important in many areas of computing science, approximation theory, and numerical analysis. For example, it is used in interpolation and approximation of functions, approximate evaluation of transforms (e.g. Hilbert, Fourier, Laplace, Hankel, and Mellon transforms as well as the fast Fourier transform). It is used in finding approximate solutions ...

Postnicov [22], in 2003, proposed an algorithm to compute the Hankel transforms of order zero and one by using Haar wavelets. But the proposed method faced problems in the evaluation of zero order Hankel transform. The purpose of this paper is to overcome this problem and obtain an efficient algorithm for evaluating Hankel transform of order zero by using rationalized Haar wavelets. Exact analy...