Fouriertransform on sparse grids with hierarchical bases

DOI10.1007/BF01385849zbMath0762.65098MaRDI QIDQ1203427

Klaus Hallatschek

Publication date: 8 February 1993

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133670

zbMATH Keywords

algorithm; fast Fourier transform; discrete Fourier transform; trigonometric interpolation; sparse grid; Korobov space; reduced complexity

Mathematics Subject Classification ID

42A15: Trigonometric interpolation

65T50: Numerical methods for discrete and fast Fourier transforms

65T40: Numerical methods for trigonometric approximation and interpolation

Related Items

Orthogonal polynomial expansions on sparse grids, On the stability of the hyperbolic cross discrete Fourier transform, Interpolation lattices for hyperbolic cross trigonometric polynomials, Multidimensional pseudo-spectral methods on lattice grids, An ultra-fast smoothing algorithm for time-frequency transforms based on Gabor functions, Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation, Fast evaluation of trigonometric polynomials from hyperbolic crosses, Fast discrete algorithms for sparse Fourier expansions of high dimensional functions, Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids

Cites Work

• On the multi-level splitting of finite element spaces
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item
• Unnamed Item