Nonequispaced Hyperbolic Cross Fast Fourier Transform
From MaRDI portal
Publication:3069078
DOI10.1137/090754947zbMath1207.65168MaRDI 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
numerical examples; spline interpolation; sparse grid; approximation error; trigonometric approximation; hyperbolic cross fast Fourier transform; multidimensional fast Fourier transform; arithmetic cost; arbitrary sampling nodes; hyperbolic cross Fourier expansion; nonequispaced hyperbolic cross fast Fourier transform
65T50: Numerical methods for discrete and fast Fourier transforms
65Y20: Complexity and performance of numerical algorithms
Related Items
NHCFFT, On the stability of the hyperbolic cross discrete Fourier transform, Interpolation lattices for hyperbolic cross trigonometric polynomials, On the fundamental conjecture of HDMR: a Fourier analysis approach, A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation, Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling, Prony's method in several variables: symbolic solutions by universal interpolation, Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations, Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
Uses Software
