The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
From MaRDI portal
Publication:4702381
DOI10.1137/S1064827597325712zbMath0941.65152MaRDI QIDQ4702381
No author found.
Publication date: 24 November 1999
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
complexity; FFT; least-squares; trigonometric series; nonuniform fast Fourier transform; interpolations; unequally spaced data; equidistant frequencies; regular Fourier matrix
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65T50: Numerical methods for discrete and fast Fourier transforms
65Y20: Complexity and performance of numerical algorithms
Related Items
Dynamic MRI reconstruction from undersampled data with an anatomical prescan, A solution to certain polynomial equations with applications to nonlinear fitting, The Fourier approximation of smooth but non-periodic functions from unevenly spaced data, Fast and accurate polar Fourier transform, A new theoretical derivation of NFFT and its implementation on GPU, Fourier series approximation of separable models, Approximate factorizations of Fourier matrices with nonequispaced knots, Fast algorithms for discrete polynomial transforms on arbitrary grids, Synthetic Aperture Radar Imaging