Fast Fourier Transforms for Nonequispaced Data
DOI10.1137/0914081zbMath0791.65108OpenAlexW2010122118WikidataQ55899314 ScholiaQ55899314MaRDI QIDQ4277775
Publication date: 7 July 1994
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e5e4c3a891997f93f539c421cae73dab078cdb79
algorithmsnumerical examplesfast Fourier transformtrigonometric polynomialsnonequidistant nodesnoninteger frequencies
Trigonometric approximation (42A10) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Complexity and performance of numerical algorithms (65Y20)
Related Items (only showing first 100 items - show all)
This page was built for publication: Fast Fourier Transforms for Nonequispaced Data