next up previous
Next: About this document ... Up: fft Previous: fft

Bibliography

1
C. ANDERSON AND M. DAHLEH, Rapid computation of the discrete Fourier transform, SIAM J. Sci. Comput., 17 (1996), pp. 913-919.

2
D. H. BAILEY AND P. N. SWARZTRAUBER, The fractional fourier transform and applications, SIAM Review, 33 (1991), pp. 389-404.

3
G. BEYLKIN, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal., 2 (1995), pp. 363-381.

4
J. BOYD, A fast algorithm for Chebyshev, Fourier and Sinc interpolation onto an irregular grid, J. Comp. Phys., 103 (1992), pp. 243-257.

5
height 2pt depth -1.6pt width 23pt, Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform, J. Comp. Phys., 103 (1992), pp. 184-186.

6
E. BRIGHAM, The Fast Fourier Transform and Its Applications, Prentice-Hall, Englewood Cliffs, NJ, 1988.

7
P. DUHAMEL AND M. VETTERLI, Fast fourier transforms: a tutorial review and a state of the art, Signal Processing, 19 (1990), pp. 259-299.

8
A. DUTT AND V. ROKHLIN, Fast Fourier transforms for non-equispaced data, SIAM J. Sci. Comput., 14 (1993), pp. 1368-1393.

9
height 2pt depth -1.6pt width 23pt, Fast Fourier transforms for non-equispaced data II, Appl. Comput. Harmon. Anal., 2 (1995), pp. 85-100.

10
H. GUO AND C. BURRUS, Fast approximate fourier transform via wavelets transform, Proc. SPIE Intl. Soc. Opt. Eng., 2825 (1996), pp. 250-259.

11
S. KUNIS AND D. POTTS, Stability results for scattered data interpolation by trigonometric polynomials, Preprint A-04-12, Mathematisches Institut, Universität Lübeck, Lübeck, Germany, 2004.

12
D. POTTS AND G. STEIDL, Fast summation at nonequispaced knots by nffts, SIAM J. Sci. Comp., 24 (2003), pp. 2013-1037.

13
D. POTTS, G. STEIDL, AND M. TASCHE, Fast fourier transform for nonequispaced data: A tutorial, in Modern Sampling Theory: Mathematics and Applications, J. Benedetto and P. Ferreira, eds., 1998, ch. 12, pp. 249-274.

14
G. STEIDL, A note on fast Fourier transforms for nonequispaced grids, Advances in Comp. Math., 9 (1998), pp. 337-352.

15
P. SWARZTRAUBER, Symmetric FFTs, Math. Comp., 47 (1986), pp. 323-346.

16
C. TEMPERTON, Self-sorting mixed-radix fast Fourier transforms, J. Comput. Phys., 52 (1983), pp. 1-23.

17
C. VAN LOAN, Computational frameworks for the fast Fourier transform, vol. 10 of Frontiers in Applied Mathematics, SIAM, Philadelphia, PA, 1992.

18
A. WARE, Fast approximate Fourier transforms for irregularly spaced data, SIAM Review, 40 (1998), pp. 838-856.



Prof. Ralf Hiptmair 2004-10-18