The purpose of this paper is to present an algorithm for evaluating Hankel transform of the null and the first kind to the series of the Bessel function for Hankel transform of the first kind and Bessel and Struve function for Hankel transform of the null kind multiplied to the wavelet coefficients of the input function. It is both the exact analytical representation and the base for effective ...

An algorithm of Dutt and Rokhlin (SIAM J Sci Comput 1993;14:1368-1383) for the computation of a fast Fourier transform (FFT) of nonuniformly-spaced data samples has been extended to two dimensions for application to MRI image reconstruction. The 2D nonuniform or generalized FFT (GFFT) was applied to the reconstruction of simulated MRI data collected on radially oriented sinusoidal excursions in...

The algorithm of Liu and Nguyen [IEEE Microw. Guided Wave Lett. 8 (1) (1998) 18; SIAM J. Sci. Comput. 21 (1) (1999) 283] for nonuniform fast Fourier transform (NUFFT) has been extended to two dimensions to reconstruct images using spiral MRI. The new gridding method, called LS_NUFFT, minimizes the reconstruction approximation error in the Least Square sense by generated convolution kernels that...

In this paper, we report the efficiency of Fourier Bessel transform and time-frequency based method in conjunction with the fractional Fourier transform, for extracting micro-Doppler radar signatures from the rotating targets. This approach comprises mainly of two processes; the first being decomposition of the radar return, in order to extract micro-Doppler (m-D) features and the second being,...

where Jν(x) is the Bessel function of the first kind of order ν [1], and =z denotes the imaginary part of z. An extensive table of integral transforms involving the Bessel functions in the kernels is collected in [6]. Since the integration in (2) is with respect to the order of the Bessel function, such a pair of integral transforms is called index transform. Details about many other index tran...

A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schlömilch and Fourier–Bessel expansions in O(N(logN)2/ loglogN) operations. The algorithm is based on an asymptotic expansion for Bessel functions of large arguments, the fast Fourier transform, and the Neumann addition formula. All the algorithmic parameters are se...

In this talk I concentrate on two topics closely related to the understanding of the energy and the system size dependence of the elliptic flow: determination of the elliptic flow (v2) “free” from the effects of non-flow and flow fluctuations, and the role of fluctuations in the initial eccentricity of the overlap region. I introduce a new approach for the analysis of the distribution in flow v...

in this paper, using a generalized dunkl translation operator, we obtain an analog of titchmarsh's theorem for the dunkl transform for functions satisfying the lipschitz-dunkl condition in $mathrm{l}_{2,alpha}=mathrm{l}_{alpha}^{2}(mathbb{r})=mathrm{l}^{2}(mathbb{r}, |x|^{2alpha+1}dx), alpha>frac{-1}{2}$.

this article is devoted to study of the autoconvolution equations and generalized mittag-leffler functions. these types of equations are given in terms of the laplace transform convolution of a function with itself. we state new classes of the autoconvolution equations of the first kind and show that the generalized mittag-leffler functions are solutions of these types of equations. in view of ...