Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Numerical Analysis

arXiv:2411.09583 (math)
[Submitted on 14 Nov 2024]

Title:A Nonuniform Fast Hankel Transform

Authors:Paul G. Beckman, Michael O'Neil
View PDF
Abstract: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.
Subjects: Numerical Analysis (math.NA)
MSC classes: 65R10
Cite as: arXiv:2411.09583 [math.NA]
  (or arXiv:2411.09583v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2411.09583

Submission history

From: Paul Beckman [view email]
[v1] Thu, 14 Nov 2024 16:50:52 UTC (1,755 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2024-11
Change to browse by:
cs
cs.NA
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)