Fast summation at nonequispaced knots by NFFTs

SIAM Journal on Scientific Computing

Volumn 24, Issue 6, 2003, Pages 2013-2037

  Potts, Daniel ^a   Steidl, Gabriele ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Fast discrete summation; Fast Fourier transform at nonequispaced knots; Radial basis functions; Toeplitz matrices

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DIGITAL ARITHMETIC; INTEGRAL EQUATIONS; MATRIX ALGEBRA; PARTIAL DIFFERENTIAL EQUATIONS;

FAST DISCRETE SUMMATION; FAST MULTIPOLE METHOD; PANEL CLUSTERING METHOD; RADIAL BASIS FUNCTIONS; TOEPLITZ MATRICES;

FAST FOURIER TRANSFORMS;

EID: 0348207634     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827502400984     Document Type: Article

References (34)

1. B. Alpert, G. Beylkin, R. Cofiman, and V. Rokhlin, Wavelet-like bases for the fast solution of second-kind integral equations, SIAM J. Sci. Comput., 14 (1993), pp. 159-184.
2. C. Anderson, A method of local corrections for computing the velocity field due to a distribution of vortex blobs, J. Comput. Phys., 62 (1986), pp. 111-123.
3. R. K. Beatson and L. Greengard, A short course on fast multipole methods, in Wavelets, Multilevel Methods and Elliptic PDEs, M. Ainsworth, J. Levesley, W. A. Light, and M. Marletta, eds., Clarendon Press, Oxford, UK, 1997.
4. R. K. Beatson and W. A. Light, Fast evaluation of radial basis functions: Methods for 2-dimensional polyharmonic splines, IMA J. Numer. Anal., 17 (1997). pp. 343-372.
5. R. K. Beatson and G. N. Newsam, Fast evaluation of radial basis functions: I., Comput. Math. Appl., 24 (1992), pp. 7-19.
6. G. Beylkin, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal., 2 (1995), pp. 363-381.
7. G. Beylkin, R. Coifman, and V. Rokhlin, Fast wavelet transforms and numerical algorithms I, Comm. Pure Appl. Math., 44 (1991), pp. 141-183.
8. G. Beylkin and R. Cramer, A multiresolution approach to regularization of singular operators and fast summation, SIAM J. Sci. Comput., 24 (2002), pp. 81-117.
9. R. H. Chan, F. R. Lin, and C. F. Chan, A fast solver for Fredholm equations of the second kind with weakly singular kernels, J. Numer. Math., 10 (2002), pp. 13-36.
10. R. H. Chan and M. K. Ng, Conjugate gradient methods of Toeplitz systems, SIAM Rev., 38 (1996), pp. 427-482.
11. A. J. W. Duijndam and M. A. Schonewille, Nonuniform fast Fourier transform, Geophysics, 64 (1999), pp. 539-551.
12. A. Dutt, M. Gu, and V. Rokhlin, Fast algorithms for polynomial interpolation, integration, and differentiation, SIAM J. Numer. Anal., 33 (1996), pp. 1689-1711.
13. A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput., 14 (1993), pp. 1368-1393.
14. J. A. Fessler and B. P. Sutton, Nonuniform fast Fourier transforms using min-max interpolation, IEEE Trans. Signal Process., to appear.
15. K. Fourmont, Schnelle Fourier-Transformation bei nichtäquidistanten Gittern und tomographische Anwendungen, Dissertation, Universität Münster, Münster, Germany, 1999.
16. S. A. Goreinov, E. E. Tyrtyshnikov and E. E. Yeremin, Matrix-free iterative solution strategies for large dense systems, Numer. Linear Algebra Appl., 4 (1997), pp. 273-294.
17. L. Greengard, The Rapid Evaluation of Potential Fields in Particle Systems, MIT Press, Cambridge, MA, 1988.
18. L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), pp. 325-348.
19. W. Hackbusch, A sparse matrix arithmetic based on H-matrices, Part I: Introduction to H-matrices, Computing, 62, (1999), pp. 89-108.
20. W. Hackbusch and Z. P. Nowak, On the fast matrix multiplication in the boundary element method by panel clustering, Numer. Math., 54 (1989), pp. 463-491.
21. A. Harten and I. Yad-Shalom, Fast multiresolution algorithms for matrix-vector multiplication, SIAM J. Numer. Anal., 31 (1994), pp. 1191-1218.
22. J. I. Jackson, Selection of a convolution function for Fourier inversion using gridding, IEEE Trans. Med. Imag., 10 (1991), pp. 473-478.
23. M. Konik, R. Schneider, and G. Steidl, Matrix sparsification by discrete multiscale methods, in Approximation Theory VIII: Approximation and Decomposition, C. K. Chui and L. L. Schumaker, eds., World Scientific, River Edge, NJ, 1995.
24. S. Kunis and D. Potts, NFFT, Softwarepackage, C subroutine library, http://www.math.uni-luebeck.de/potts/nfft (2002).
25. N. Nguyen and Q. H. Liu, The regular Fourier matrices and nonuniform fast Fourier transforms, SIAM J. Sci. Comput., 21 (1999), pp. 283-293.
26. A. Nieslony and G. Steidl, Approximate factorizations of Fourier matrices with nonequispaced knots, Linear Algebra Appl., to appear.
27. D. Potts and G. Steidl, Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems, Linear Algebra Appl., 281 (1998), pp. 265-292.
28. D. Potts, G. Steidl, and M. Tasche, Trigonometric preconditioners for block Toeplitz systems, in Multivariate Approximation and Splines, G. Nürnberger, J. W. Schmidt, and G. Walz, eds., Birkhäuser, Basel, 1997, pp. 219-234.
29. D. Potts, G. Steidl, and M. Tasche, Fast Fourier transforms for nonequispaced data: A tutorial, in Modern Sampling Theory: Mathematics and Applications, J. J. Benedetto and P. J. S. G. Ferreira, eds., Birkhäser, Boston, 2001, pp. 247-270.
30. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C, Cambridge University Press, Cambridge, UK, 1992.
31. G. Steidl, A note on fast Fourier transforms for nonequispaced grids, Adv. Comput. Math., 9 (1998), pp. 337-353.
32. X. Sun and N. P. Pitsianis, A matrix version of the fast multipole method, SIAM Rev., 43 (2001), pp. 289-300.
33. E. E. Tyrtyshnikov, Mosaic-skeleton approximations, Calcolo, 33 (1996), pp. 47-57.
34. N. Yarvin and V. Rokhlin, An improved fast multipole algorithm for potential fields on the line, SIAM J. Numer. Anal., 36 (1999), pp. 629-666.