𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast computation of zero order Hankel transform

✍ Scribed by K. Gopalan; C.S. Chen

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
442 KB
Volume
316
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

An algorithmfor numerical evaluation ofzero order Hankel transform is developed. The method involves one FFT evaluation and a summation of the interpolated FFT components.

It comparesfavorably with other available techniques with regard to speed, accuracy, and ease of usage.

πŸ“œ SIMILAR VOLUMES

Methods for Fast Computation of Integral
Methods for Fast Computation of Integral Transforms
✍ Shay Gueron πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 394 KB

This paper is concerned with two aspects of the numerical calculation of integral transforms. The first is finding a necessary and sufficient condition that enables converting an integral transform into a correlation (convolution) form. The condition and the transformation that implements it are gen

Generalized Fourier Transform for SchrΓΆd
Generalized Fourier Transform for SchrΓΆdinger Operators with Potentials of Order Zero
✍ Shmuel Agmon; Jaime Cruz-Sampedro; Ira Herbst πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 206 KB

We investigate the Schro dinger operator H=&2+V acting in L 2 (R n ), n 2, for potentials V that satisfy : x V(x)=O(|x| &|:| ) as |x| Γ„ . By introducing coordinates on R n closely related to a relevant eikonal equation we obtain an eigenfunction expansion for H at high energies.