Nonequispaced hyperbolic cross fast Fourier transform - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Numerical Analysis Year : 2010

Nonequispaced hyperbolic cross fast Fourier transform

Abstract

A straightforward discretization of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like the fast Fourier transform (FFT) have high computational costs. Hyperbolic cross approximations allow for a severe decrease in the number of used Fourier coefficients to represent functions with bounded mixed derivatives. We propose a nonequispaced hyperbolic cross FFT based on one hyperbolic cross FFT and a dedicated interpolation by splines on sparse grids. Analogously to the nonequispaced FFT for trigonometric polynomials with Fourier coefficients supported on the full grid, this allows for the efficient evaluation of trigonometric polynomials with Fourier coefficients supported on the hyperbolic cross at arbitrary spatial sampling nodes.
No file

Dates and versions

hal-00954249 , version 1 (28-02-2014)

Identifiers

Cite

Michael Döhler, Stefan Kunis, Daniel Potts. Nonequispaced hyperbolic cross fast Fourier transform. SIAM Journal on Numerical Analysis, 2010, 47 (6), pp.4415-4428. ⟨10.1137/090754947⟩. ⟨hal-00954249⟩

Collections

INSMI TDS-MACS
118 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More