Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00954249
Contributor : Michael Döhler <>
Submitted on : Friday, February 28, 2014 - 5:43:32 PM
Last modification on : Wednesday, May 19, 2021 - 4:18:06 PM

Identifiers

Collections

Citation

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

Share

Metrics

Record views

270