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

algorithmnumerical experimentssparse matricesFrobenius normsparse factorizationmatrix-vector multiplicationnonuniform fast Fourier transformwindow functionFourier matricesleast square approximationKaiser-Bessel function

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

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

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

This page was built for publication: Approximate factorizations of Fourier matrices with nonequispaced knots