Nonuniform fast Hankel transform (NUFHT) algorithm.

Journal Article (Journal Article)

We investigate the fast computation of Hankel transforms on a set of nonuniformly spaced sample points. Previous fast Hankel transform (FHT) algorithms require the sample points to distribute uniformly in a logarithmic scale. This limitation is removed here by the use of the newly developed, to our knowledge, nonuniform fast Fourier transform algorithm. The resulting nonuniform FHT algorithm has a much higher accuracy than the previous FHT algorithms and provides important flexibility in many applications.

Full Text

Duke Authors

Cited Authors

  • Liu, QH; Zhang, ZQ

Published Date

  • November 1999

Published In

Volume / Issue

  • 38 / 32

Start / End Page

  • 6705 - 6708

PubMed ID

  • 18324208

Pubmed Central ID

  • 18324208

Electronic International Standard Serial Number (EISSN)

  • 1539-4522

International Standard Serial Number (ISSN)

  • 1559-128X

Digital Object Identifier (DOI)

  • 10.1364/ao.38.006705


  • eng