Fast algorithms for discrete polynomial transforms on arbitrary grids

Linear Algebra and Its Applications

Volumn 366, Issue SPEC. ISS., 2003, Pages 353-370

  Potts, Daniel ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

B splines; Chebyshev knots; Discrete polynomial transform; Fast cosine transform; Fast Fourier transform; Fast polynomial transform; Gaussian bells; Nonequispaced grids; Vandermonde like matrix

Indexed keywords

EID: 0037409860     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00592-X     Document Type: Conference Paper

References (25)

1. G. Baszenski, Programmpaket zur Berechnung diskreter trigonometrischer Transformationen, 1995. http://www.iuk.fh-dortmund.de/~baszenski/
2. G. Baszenski, and M. Tasche Fast polynomial multiplication and convolution related to the discrete cosine transform Linear Algebra Appl. 252 1997 1 25
3. G. Beylkin On the fast Fourier transform of functions with singularities Appl. Comput. Harmon. Anal. 2 1995 363 381
4. D. Bini, V. Pan, Polynomial and Matrix Computations, vol. 1, Birkhäuser, Boston, 1994
5. P. Butzer, and R. Stensm The operational properties of the Chebyshev transform. I: General properties Funct. Approx. Comment. Math. 5 1977 129 160
6. C.K. Chui An Introduction to Wavelets 1992 Academic Press Boston
7. J. Driscoll, and D. Healy Computing Fourier transforms and convolutions on the 2-sphere Adv. Appl. Math. 15 1994 202 240
8. J. Driscoll, D. Healy, and D. Rockmore Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs SIAM J. Comput. 26 1996 1066 1099
9. J.O. Droese, Verfahren zur schnellen Fourier-Transformation mit nichtäquidistanten Knoten, Master's thesis, TU Darmstadt, 1996
10. A.J.W. Duijndam, and M.A. Schonewille Nonuniform fast Fourier transform Geophysics 64 1999 539 551
11. A. Dutt, M. Gu, and V. Rokhlin Fast algorithms for polynomial interpolation, integration and differentiation SIAM J. Numer. Anal. 33 1996 1689 1711
12. A. Dutt, and V. Rokhlin Fast Fourier transforms for nonequispaced data II SIAM J. Sci. Stat. Comput. 14 1993 1368 1393
13. A. Dutt, and V. Rokhlin Fast Fourier transforms for nonequispaced data II Appl. Comput. Harmon. Anal. 2 1995 85 100
14. E. Elbel Mehrdimensionale Fouriertransformation für nichtäquidistanten Daten 1998 Diplomarbeit TH Darmstadt
15. G. Heinig, K. Rost, Representations of Cauchy matrices with Chebyshev nodes using trigonometric transformations, in: D. Bini, E. Tyrtyshnikov, P. Yalamov (Eds.), Structured Matrices: Recent Developments in Theory and Computation, vol. 4 of Advances in Computation: Theory and Practice, Nova Science Inc., 2001, pp. 135-148
16. J.I. Jackson Selection of a convolution function for Fourier inversion using gridding IEEE Trans. Med. Imaging 10 1991 473 478
17. N. Nguyen, and Q.H. Liu The regular Fourier matrices and nonuniform fast Fourier transforms SIAM J. Sci. Comput. 21 1999 283 293
18. J. Pelt Fast computation of trigonometric sums with applications to frequency analysis of astronomical data D. Maoz, A. Sternberg, E. Leibowitz, Astronomical Time Series 1997 Kluwer Academic Publishers 179 182
19. G. Plonka, K. Selig, and M. Tasche On the construction of wavelets on a bounded interval Adv. Comput. Math. 4 1995 357 358
20. D. Potts, G. Steidl, and M. Tasche Fast algorithms for discrete polynomial transforms Math. Comp. 67 1998 1577 1590
21. D. Potts, G. Steidl, M. Tasche, Fast Fourier transforms for nonequispaced data: a tutorial, in: J.J. Benedetto, P.J.S.G. Ferreira (Eds.), Modern Sampling Theory: Mathematics and Applications, Boston, 2001, pp. 247-270
22. G. Steidl A note on fast Fourier transforms for nonequispaced grids Adv. Comput. Math. 9 1998 337 353
23. G. Steidl, and M. Tasche A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms Math. Comp. 56 1991 281 296
24. A.F. Ware Fast approximate Fourier transforms for irregularly spaced data SIAM Rev. 40 1998 838 856
25. N. Yarvin, and V. Rokhlin An improved fast multipole algorithm for potential fields on the line SIAM J. Numer. Anal. 36 1999 629 666