Approximate factorizations of Fourier matrices with nonequispaced knots

Linear Algebra and Its Applications

Volumn 366, Issue SPEC. ISS., 2003, Pages 337-351

  Nieslony, A ^a   Steidl, G ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Frobenius norm; Least square approximation; Nonuniform fast Fourier transform; Sparse factorization

Indexed keywords

EID: 0037409931     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00496-2     Document Type: Conference Paper

References (22)

1. C. Anderson, and M. Dillon Dahleh Rapid computation of the discrete Fourier transform SIAM J. Sci. Comput. 17 1996 913 919
2. G. Beylkin On the fast Fourier transform of functions with singularities Appl. Comput. Harmon. Anal. 2 1995 363 381
3. A. Brandt Multilevel computations of integral transforms and particle interactions with oscillatory kernels Comput. Phys. Comm. 65 1991 24 38
4. J.W. Cooley, and J.W. Tukey An algorithm for the machine computation of complex Fourier series Math. Comp. 19 1965 297 301
5. A.J.W. Duijndam, and M.A. Schonewille Nonuniform fast Fourier transform Geophysics 64 1999 539 551
6. A. Dutt, and V. Rokhlin Fast Fourier transforms for nonequispaced data SIAM J. Sci. Statist. Comput. 14 1993 1368 1393
7. A. Dutt, and V. Rokhlin Fast Fourier transforms for nonequispaced data II Appl. Comput. Harmon. Anal. 2 1995 85 100
8. A. Elbel, and G. Steidl Fast Fourier transforms for nonequispaced data C.K. Chui, L.L. Schumaker, Approximation Theory IX 1998 Vanderbuilt University Press 39 46
9. K. Fourmont, Schnelle Fourier-Transformation bei nichtäquidistenten Gittern und tomographische Anwendungen, Ph.D. thesis, University of Münster, 1999
10. J.I. Jackson Selection of a convolution function for Fourier inversion using gridding IEEE Trans. Medical Imaging 10 1991 473 478
11. J.F. Kaiser Digital filters F. Kuo, J.F. Kaiser, System Analysis by Digital Computer 1966 Wiley New York 218 285
12. T.W. Körner Fourier Analysis 1996 Cambridge University Press Cambridge
13. N. Ngyuen, and Q.H. Liu The regular Fourier matrices and nonuniform fast Fourier transforms SIAM J. Sci. Comput. 21/1 1999 283 293
14. H.J. Nussbaumer Fast Fourier Transform and Convolution Algorithms 1981 Springer-Verlag Berlin
15. J. Pelt, Fast computation of trigonometric sums with application to frequency analysis of astronomical data, Preprint, 1997
16. D. Potts, G. Steidl, and M. Tasche Fast Fourier transforms for nonequispaced data: a tutorial J.J. Benedetto, P. Ferreira, Modern Sampling Theory: Mathematics and Applications 2000 Birkhäuser Basel 253 274
17. D. Potts, and G. Steidl A new linogram algorithm for computerized tomography IMA J. Numer. Anal. 21 3 2001 769 782
18. W.H. Press, and G.B. Rybicki Fast algorithms for spectral analysis of unevenly sampled data Astrophys. J. 338 1989 227 280
19. D. Slepian Some comments on Fourier analysis, uncertainty and modeling SIAM Rev. 25 3 1983 379 393
20. G. Steidl A note on fast Fourier transforms for nonequispaced grids Adv. Comp. Math. 9 1998 337 352
21. C. Van Loan Computational Frameworks for the Fast Fourier Transform 1992 SIAM Philadelphia
22. A. Ware Fast approximate Fourier transforms for irregularly spaced data SIAM Rev. 40 1998 838 859