An improved method for computing a discrete Hankel transform

DOI10.1016/0010-4655(87)90204-9zbMATH Open0664.65122OpenAlexW2130659258MaRDI QIDQ1115554FDOQ1115554

Authors: H. Fisk Johnson 

Publication date: 1987

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4655(87)90204-9

Recommendations

• Fast Hankel transform algorithm
• Fast computation of zero order Hankel transform
• An improved method for computing Hankel transform
• A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
• Fast discrete finite Hankel transform for equations in a thin annulus

zbMATH Keywords

algorithmtransport equationfast Fourier transformelectron scatteringdiscrete Hankel transform

Mathematics Subject Classification ID

Numerical methods for integral transforms (65R10) Special integral transforms (Legendre, Hilbert, etc.) (44A15)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• Fast Hankel transforms algorithm based on kernel function interpolation with exponential functions
• Fast discrete finite Hankel transform for equations in a thin annulus
• Fractionalization of a discrete Hankel transform based on an involutory symmetric kernel matrix
• Optimal cylindrical and spherical Bessel transforms satisfying bound state boundary conditions
• Generalized discrete Fourier transforms: The discrete Fourier-Riccati-Bessel transform
• A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
• Exponential time-differencing with embedded Runge-Kutta adaptive step control
• Title not available (Why is that?)
• A dual algorithm for fast calculation of the \(H^ 1_ 0\)-transform

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115554)