Regular Fourier matrices and nonuniform fast Fourier transforms

SIAM Journal of Scientific Computing

Volumn 21, Issue 1, 1999, Pages 283-293

  Nguyen, Nhu ^a   Liu, Qing Huo ^b  

^a NEW MEXICO STATE UNIVERSITY   (United States)

^b New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; FAST FOURIER TRANSFORMS; INTERPOLATION; PROBLEM SOLVING;

FOURIER MATRIX; TRIGONOMETRIC SERIES; UNEQUALLY SPACED DATA;

MATRIX ALGEBRA;

EID: 0033295052     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827597325712     Document Type: Article

References (3)

1. G. BEYLKIN, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal., 2 (1995), pp. 363-382.
2. J.W. COOLEY AND J.W. TUKEY, Algorithm for the machine computation of complex Fourier series, Math. Comp., 19 (1965), pp. 297-301.
3. A. DUTT AND V. ROKHLIN, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput., 14 (1993), pp. 1368-1393.