Nonequispaced Hyperbolic Cross Fast Fourier Transform

DOI10.1137/090754947zbMath1207.65168OpenAlexW1974330775MaRDI QIDQ3069078

Stefan Kunis, Michael Döhler, Daniel Potts

Publication date: 24 January 2011

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

numerical examplesspline interpolationsparse gridapproximation errortrigonometric approximationhyperbolic cross fast Fourier transformmultidimensional fast Fourier transformarithmetic costarbitrary sampling nodeshyperbolic cross Fourier expansionnonequispaced hyperbolic cross fast Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (12)

Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids ⋮ Prony's method in several variables: symbolic solutions by universal interpolation ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ On computing high-dimensional Riemann theta functions ⋮ On the stability of the hyperbolic cross discrete Fourier transform ⋮ On the fundamental conjecture of HDMR: a Fourier analysis approach ⋮ Interpolation lattices for hyperbolic cross trigonometric polynomials ⋮ Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods ⋮ A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation ⋮ NHCFFT ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

Uses Software

• Matlab
• Algorithm 862
• NFFT
• NFFT3

This page was built for publication: Nonequispaced Hyperbolic Cross Fast Fourier Transform