Fouriertransform on sparse grids with hierarchical bases

DOI10.1007/BF01385849zbMath0762.65098OpenAlexW1494602634MaRDI 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

algorithmfast Fourier transformdiscrete Fourier transformtrigonometric interpolationsparse gridKorobov spacereduced complexity

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (26)

Fourier spectral method on sparse grids for computing ground state of many-particle fractional Schrödinger equations ⋮ Trigonometric interpolation on lattice grids ⋮ Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids ⋮ Fast discrete algorithms for sparse Fourier expansions of high dimensional functions ⋮ Sparse grid approximation in weighted Wiener spaces ⋮ On computing high-dimensional Riemann theta functions ⋮ On the stability of the hyperbolic cross discrete Fourier transform ⋮ Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials ⋮ Orthogonal polynomial expansions on sparse grids ⋮ A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions ⋮ Interpolation lattices for hyperbolic cross trigonometric polynomials ⋮ Fast sparse nonlinear Fourier expansions of high dimensional functions ⋮ An ultra-fast smoothing algorithm for time-frequency transforms based on Gabor functions ⋮ Fourier pseudospectral method on generalized sparse grids for the space-fractional Schrödinger equation ⋮ Fast evaluation of trigonometric polynomials from hyperbolic crosses ⋮ Speeding up the flash calculations in two-phase compositional flow simulations - the application of sparse grids ⋮ Sparse Grids for the Vlasov–Poisson Equation ⋮ Multidimensional pseudo-spectral methods on lattice grids ⋮ Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform ⋮ Generalized sparse grid interpolation based on the fast discrete Fourier transform ⋮ Efficiently transforming from values of a function on a sparse grid to basis coefficients ⋮ Fast Discrete Fourier Transform on Generalized Sparse Grids ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling

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

This page was built for publication: Fouriertransform on sparse grids with hierarchical bases