A Nonuniform Fast Hankel Transform

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Beckman, Paul G., O'Neil, Michael
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912119321001984
author Beckman, Paul G.
O'Neil, Michael
author_facet Beckman, Paul G.
O'Neil, Michael
contents We describe a fast algorithm for computing discrete Hankel transforms of moderate orders from $n$ nonuniform points to $m$ nonuniform frequencies in $O((m+n)\log\min(n,m))$ operations. Our approach combines local and asymptotic Bessel function expansions with nonuniform fast Fourier transforms. The order of each expansion is adjusted automatically according to error analysis to obtain any desired precision $\varepsilon$. Several numerical examples are provided which demonstrate the speed and accuracy of the algorithm in multiple regimes and applications.
format Preprint
id arxiv_https___arxiv_org_abs_2411_09583
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Nonuniform Fast Hankel Transform
Beckman, Paul G.
O'Neil, Michael
Numerical Analysis
65R10
We describe a fast algorithm for computing discrete Hankel transforms of moderate orders from $n$ nonuniform points to $m$ nonuniform frequencies in $O((m+n)\log\min(n,m))$ operations. Our approach combines local and asymptotic Bessel function expansions with nonuniform fast Fourier transforms. The order of each expansion is adjusted automatically according to error analysis to obtain any desired precision $\varepsilon$. Several numerical examples are provided which demonstrate the speed and accuracy of the algorithm in multiple regimes and applications.
title A Nonuniform Fast Hankel Transform
topic Numerical Analysis
65R10
url https://arxiv.org/abs/2411.09583