Fast summation based on fast trigonometric transforms at non-equispaced nodes

Numerical Linear Algebra with Applications

Volumn 12, Issue 2-3, 2005, Pages 161-169

  Fenn, Markus ^a   Potts, Daniel ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Cosine and sine transforms at non equispaced knots; Fast discrete summation; Fast Fourier; NDCT; NDST; NFFT

Indexed keywords

EID: 20744431888     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.407     Document Type: Article

References (19)

1. Greengard L, Rokhlin V. A fast algorithm for particle simulations. Journal of Computational Physics 1987; 73:325-348.
2. Beatson RK, Newsam GN. Fast evaluation of radial basis functions: I. Computational and Applied Mathematics 1992; 24:7-19.
3. Hackbusch W, Nowak ZP. On the fast matrix multiplication in the boundary element method by panel clustering. Numerische Mathematik 1989; 54:463-491.
4. Hackbusch W. A sparse matrix arithmetic based on ℋ-matrices, Part I: introduction to ℋ-matrices. Computing 1999; 62:89-108.
5. Tyrtyshnikov EE. Mosaic-skeleton approximations. Calcolo 1996; 33:47-57.
6. Beylkin G, Cramer R. A multiresolution approach to regularization of singular operators and fast summation. SIAM Journal on Scientific Computing 2002; 24:81-117.
7. Beylkin G, Coifman R, Rokhlin V. Fast wavelet transforms and numerical algorithms I. Communications on Pure and Applied Mathematics 1991; 44:141-183.
8. Potts D, Steidl G. Fast summation at nonequispaced knots by NFFTs. SIAM Journal on Scientific Computing 2003; 24:2013-2037.
9. Potts D. Fast algorithms for discrete polynomial transforms on arbitrary grids. Linear Algebra and its Applications 2003; 366:353-370.
10. Tian B, Liu QH. Nonuniform fast cosine transform and Chebyshev PSTD algorithm. Journal of Electromagnetic Waves and Applications 2000; 14:797-798.
11. Steidl G. A note on fast Fourier transforms for nonequispaced grids. Advances in Computational Mathematics 1998; 9:337-353.
12. Potts D, Steidl G, Tasche M. Fast Fourier transforms for nonequispaced data: a tutorial. In Modern Sampling Theory: Mathematics and Applications, Benedetto JJ, Ferreira PJSG (eds). Birkhäuser: Boston, 2001; 247-270.
13. Dutt A, Rokhlin V. Fast Fourier transforms for nonequispaced data. SIAM Journal on Statistical and Scientific Computing 1993; 14:1368-1393.
14. Duijndam AJW, Schonewille MA. Nonuniform fast Fourier transform. Geophysics 1999; 64:539-551.
15. Beylkin G. On the fast Fourier transform of functions with singularities. Applied and Computational Harmonic Analysis 1995; 2:363-381.
16. Kunis S, Potts D. NFFT, Softwarepackage, C subroutine library, http://www.math.uni-luebeck.de/potts/nfft, 2002.
17. Jackson JI. Selection of a convolution function for Fourier inversion using gridding. IEEE Transactions on Medical Imaging 1991; 10:473-478.
18. Fourmont K. Schnelle Fourier-Transformation bei nichtäquidistanten Gittern und tomographische Anwendungen. Dissertation, Universität Münster, 1999.
19. Press WH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical Recipes in C. Cambridge University Press: Cambridge, 1992.