An improved method for computing a discrete Hankel transform

DOI10.1016/0010-4655(87)90204-9MaRDI QIDQ1115554zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmdiscrete Hankel transformelectron scatteringfast Fourier transformtransport equation

Mathematics Subject Classification ID

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

Review text

A new and simple algorithm for computing a discrete Hankel transform, which does not rely on the fast Fourier transform is described. In the solution of certain types of differential equations this algorithm can provide a major improvement in speed and accuracy over previously described methods. An application to a particular form of the transport equation relevant to a class of problems in electron scattering is given.

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

Cited in

(12)

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

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)