Algorithms to numerically evaluate the Hankel transform
From MaRDI portal
Publication:2367575
A variety of algorithms exists for the numerical evaluation of the Hankel transform. The present paper is devoted to a comparative study of some of the useful algorithms. It is found that the performance of all algorithms depends mainly on the function to be transformed. However, projection based methods are found to be better than numerical quadrature methods.
Recommendations
Cites work
- A Fourier Bessel transform method for efficiently calculating the magnetic field of solenoids
- A Method for Computing Bessel Function Integrals
- A Short Table of � ∞ x J 0 (t)t -n dt and � ∞ x J 1 (t) t -n dt
- An algorithm for the numerical evaluation of the Hankel and Abel transforms
- Approximation for Bessel functions and their application in the computation of Hankel transforms
- Computation of the Hankel transform using projections
- Dual algorithms for fast calculation of the Fourier-Bessel transform
- Evaluation of Bessel function integrals with algebraic singularities
- Fast computation of zero order Hankel transform
- Fast Hankel transform algorithm
- Gaussian Quadrature Formulas for the Evaluation of Fourier‐Cosine Coefficients
- scientific article; zbMATH DE number 3121130 (Why is no real title available?)
- scientific article; zbMATH DE number 3278469 (Why is no real title available?)
- Modified Clenshaw-Curtis method for the computation of Bessel function integrals
- Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions
- Numerical evaluation of spherical Bessel transforms via fast Fourier transforms
- Numerical Fourier and Bessel transforms in logarithmic variables
- Simultaneous calculation of Fourier-Bessel transforms up to order N
- Tables for the Rapid and Accurate Numerical Evaluation of Certain Infinite Integrals Involving Bessel Functions
- Towards a discrete hanke! transform and its applications
Cited in
(21)- Filon trapezoidal schemes for Hankel transforms of orders zero and one
- An application of wavelet technique in numerical evaluation of Hankel transforms
- A spectral, quasi-cylindrical and dispersion-free particle-in-cell algorithm
- Numerical evaluation of the Hankel transform
- A quadrature formula for the Hankel transform
- Evaluating infinite integrals involving Bessel functions of arbitrary order
- A wavelet algorithm for Fourier-Bessel transform arising in optics
- Application of wavelets in numerical evaluation of Hankel transform arising in seismology
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
- Projection method for the Hankel transform
- Foundations of Hankel transform algorithms
- A fast algorithm for computing the Hankel transform of order 1
- scientific article; zbMATH DE number 5694280 (Why is no real title available?)
- NUMERICAL SIMULATIONS OF THE ENERGY-SUPERCRITICAL NONLINEAR SCHRÖDINGER EQUATION
- An algorithm for the numerical evaluation of the Hankel and Abel transforms
- Fast Hankel transform algorithm
- Algorithm 794
- A stable and convergent algorithm to evaluate Hilbert transform
- Fast adaptive Fourier integration for spectral densities of Gaussian processes
- Matrix-based evaluation of the fractional Hankel transform by Bessel series expansion
- A nonuniform fast Hankel transform
This page was built for publication: Algorithms to numerically evaluate the Hankel transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367575)
