The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms

DOI10.1137/S1064827597325712zbMath0941.65152OpenAlexW2038213383MaRDI QIDQ4702381

No author found.

Publication date: 24 November 1999

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827597325712

zbMATH Keywords

complexityFFTleast-squarestrigonometric seriesnonuniform fast Fourier transforminterpolationsunequally spaced dataequidistant frequenciesregular Fourier matrix

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (11)

Approximate factorizations of Fourier matrices with nonequispaced knots ⋮ Fast algorithms for discrete polynomial transforms on arbitrary grids ⋮ Fast and accurate polar Fourier transform ⋮ A solution to certain polynomial equations with applications to nonlinear fitting ⋮ Dynamic MRI reconstruction from undersampled data with an anatomical prescan ⋮ A new theoretical derivation of NFFT and its implementation on GPU ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ The New Operator Marching Method on Calculating the Electromagnetic Scattered Fields from the Periodic Structures ⋮ Synthetic Aperture Radar Imaging ⋮ Joint image formation and two-dimensional autofocusing for synthetic aperture radar data ⋮ Fourier series approximation of separable models

This page was built for publication: The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms