Approximate factorizations of Fourier matrices with nonequispaced knots

DOI10.1016/S0024-3795(02)00496-2zbMath1018.65154MaRDI QIDQ1874676

A. Nieslony, Gabriele Drauschke

Publication date: 25 May 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithm; numerical experiments; sparse matrices; Frobenius norm; sparse factorization; matrix-vector multiplication; nonuniform fast Fourier transform; window function; Fourier matrices; least square approximation; Kaiser-Bessel function

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65T50: Numerical methods for discrete and fast Fourier transforms

Related Items

Fast spherical Fourier algorithms., A new theoretical derivation of NFFT and its implementation on GPU, The type 3 nonuniform FFT and its applications, Direct inversion of the nonequispaced fast Fourier transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on fast Fourier transforms for nonequispaced grids
• Fast Fourier transforms for nonequispaced data. II
• Multilevel computations of integral transforms and particle interactions with oscillatory kernels
• On the fast Fourier transform of functions with singularities
• Divergence of decreasing rearranged Fourier series
• A new linogram algorithm for computerized tomography
• Some comments on Fourier analysis, uncertainty and modeling
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Fourier Transforms for Nonequispaced Data
• The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
• Rapid Computation of the Discrete Fourier Transform
• An Algorithm for the Machine Calculation of Complex Fourier Series