An improved method for computing Hankel transform

DOI10.1016/J.JFRANKLIN.2008.07.002zbMath1163.65096OpenAlexW2066926369MaRDI QIDQ1017562

J. Martínez

Publication date: 12 May 2009

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2008.07.002

zbMATH Keywords

algorithmnumerical examplesBessel functionsFourier-Bessel seriesfinite Hankel transformrationalized Haar wavelets

Mathematics Subject Classification ID

Numerical methods for wavelets (65T60) Integral transforms of special functions (44A20) Numerical methods for integral transforms (65R10)

Related Items (2)

A stable Hankel transforms algorithm based on Haar wavelet decomposition for noisy data ⋮ Fast Hankel transforms algorithm based on kernel function interpolation with exponential functions

Cites Work

• Unnamed Item
• Unnamed Item
• Finite Hankel transforms of distributions
• Numerical evaluation of the zero-order Hankel transform using Filon quadrature philosophy
• About calculation of the Hankel transform using preliminary wavelet transform
• An inverse quasi-static steady-state thermal stresses in a thick circular plate
• Fast Hankel transform by fast sine and cosine transforms: the Mellin connection
• Dual algorithms for fast calculation of the Fourier-Bessel transform
• An algorithm for the numerical evaluation of the Hankel and Abel transforms
• Fast Hankel transform algorithm
• Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions
• Computation of the Hankel transform using projections
• Haar wavelet method for solving lumped and distributed-parameter systems

This page was built for publication: An improved method for computing Hankel transform