Fast fourier transforms for nonequispaced data, II

Applied and Computational Harmonic Analysis

Volumn 2, Issue 1, 1995, Pages 85-100

  Dutt, A ^a   Rokhlin, V ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATION THEORY; DIFFERENTIATION (CALCULUS); EIGENVALUES AND EIGENFUNCTIONS; INVERSE PROBLEMS; NUMERICAL METHODS;

CPU TIME; MULTIPOLE METHOD; NONEQUISPACED NODES; NONINTEGER FREQUENCY;

FAST FOURIER TRANSFORMS;

EID: 0029207497     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1006/acha.1995.1007     Document Type: Article

References (20)

1. B. Alpert, G. Beylkin, R. Coifman, and V. Rokhlin, Wavelets for the fast solution of second-kind integral equations, SIAM J. Sei. Statist. Comput. 14 (1993).
2. B. Alpert and V. Rokhlin, “A Fast Algorithm for the Evaluation of Legendre Expansions,” Tech. Rep. 671, Department of Computer Science, Yale University, 1988.
3. H. Bailey and P. N. Swarztrauber, The fractional Fourier transform and applications, SIAM Rev. 33 (1991), 389-404.
4. G. Beylkin, R. Coifman, and V. Rokhlin, Fast wavelet transforms and numerical algorithms I, Comm. Pure Appl. Math. 44 (1991), 141-183.
5. J. Boyd, Multipole expansions and pseudospectral Cardinal functions: A new generalization of the fast Fourier transform, J. Comput. Phys. 103 (1992), 184-186.
6. Oran Brigham, “The Fast Fourier Transform and Its Applications,” Prentice-Hall, Englewood Cliffs, NJ, 1988.
7. J. Carrier, L. Greengard, and V. Rokhlin, A fast adaptive multipole algorithm for particle simulations, SIAM J. Sei. Statist. Comput. 9 (1988), 669-686.
8. J. W. Cooley and J. W. Tukey, An algorithm for the machine compu-tation of complex Fourier series, Math. Comp. 19 (1965), 297-301.
9. G. Dahlquist and A. Bjorck, “Numerical Methods,” Prentice-Hall, Englewood Cliffs, NJ, 1974.
10. A. Dutt, M. Gu, and V. Rokhlin, “Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation," Tech. Rep. 977, Department of Computer Science, Yale University, 1993.
11. A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM J. Sei. Statist. Comput., to appear.
12. D. Gottlieb, M. Y. Hussaini, and S. Orszag, in “Spectral Methods for Partial Differential Equations” (R. G. Voigt, D. Gottlieb, and M. Y. Hussaini, Eds.), p. 1, SIAM, Philadelphia, 1984.
13. D. Gottlieb and S. Orszag, “Numerical Analysis of Spectral Methods” SIAM, Philadelphia, 1977.
14. L.S. Gradshteyn and I. M. Ryzhik, “Table of Integrals, Series, and Products," Academic Press, New York, 1980.
15. L. Greengard, “Spectral Integration and Two-Point Boundary Value Problems,” Tech. Rep. 646, Department of Computer Science, Yale University, 1988.
16. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comput. Phys. 73 (1987), 325-348.
17. V. Rokhlin, A fast algorithm for the discrete Laplace transformation, J. Complexity 4 (1988), 12-32.
18. J. Stoer and R. Bulirsch, “Introduction to Numerical Analysis,” Springer-Verlag, New York, 1980.
19. C. Van Loan, “Computational Frameworks for the Fast Fourier Transform,’' SIAM, Philadelphia, 1992.
20. H. Joseph Weaver, “Theory of Discrete and Continuous Fourier Analysis," Wiley, New York, 1989.