Nonuniform fast Hankel transform (NUFHT) algorithm

被引:12
作者
Liu, QH [1 ]
Zhang, ZQ [1 ]
机构
[1] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
关键词
D O I
10.1364/AO.38.006705
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
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. (C) 1999 Optical Society of America OCIS codes: 070.2590, 070.6020.
引用
收藏
页码:6705 / 6708
页数:4
相关论文
共 12 条
[1]  
[Anonymous], 1965, HDB MATH FUNCTIONS
[2]  
BALANIS CA, 1989, ADV ENG ELECTROMAGNE, P300
[3]   ON THE FAST FOURIER-TRANSFORM OF FUNCTIONS WITH SINGULARITIES [J].
BEYLKIN, G .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 1995, 2 (04) :363-381
[4]   FAST FOURIER-TRANSFORMS FOR NONEQUISPACED DATA [J].
DUTT, A ;
ROKHLIN, V .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (06) :1368-1393
[5]   FAST HANKEL-TRANSFORMS [J].
JOHANSEN, HK ;
SORENSEN, K .
GEOPHYSICAL PROSPECTING, 1979, 27 (04) :876-901
[6]   APPLICATIONS OF THE CONJUGATE-GRADIENT FAST FOURIER HANKEL TRANSFER METHOD WITH AN IMPROVED FAST HANKEL TRANSFORM ALGORITHM [J].
LIU, QH ;
CHEW, WC .
RADIO SCIENCE, 1994, 29 (04) :1009-1022
[7]   An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's) [J].
Liu, QH ;
Nguyen, N .
IEEE MICROWAVE AND GUIDED WAVE LETTERS, 1998, 8 (01) :18-20
[8]   Iterative algorithm for nonuniform inverse fast Fourier transform (NU-IFFT) [J].
Liu, QH ;
Tang, XY .
ELECTRONICS LETTERS, 1998, 34 (20) :1913-1914
[9]   FAST ALGORITHM FOR THE COMPUTATION OF THE ZERO-ORDER HANKEL TRANSFORM [J].
MURPHY, PK ;
GALLAGHER, NC .
JOURNAL OF THE OPTICAL SOCIETY OF AMERICA, 1983, 73 (09) :1130-1137
[10]  
NGUYEN N, IN PRESS SIAM SOC IN