Fast Discrete Fourier Transform on Generalized Sparse Grids
From MaRDI portal
Publication:5254892
DOI10.1007/978-3-319-04537-5_4zbMath1316.65119OpenAlexW204604922MaRDI QIDQ5254892
Michael Griebel, Jan Hamaekers
Publication date: 10 June 2015
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04537-5_4
Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items (19)
Fourier spectral method on sparse grids for computing ground state of many-particle fractional Schrödinger equations ⋮ Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in \(H^\gamma\) ⋮ Trigonometric interpolation on lattice grids ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation ⋮ Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness ⋮ Sparse grid approximation in weighted Wiener spaces ⋮ Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials ⋮ A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions ⋮ Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods ⋮ Sampling and cubature on sparse grids based on a B-spline quasi-interpolation ⋮ Efficient multivariate approximation on the cube ⋮ Fourier pseudospectral method on generalized sparse grids for the space-fractional Schrödinger equation ⋮ Speeding up the flash calculations in two-phase compositional flow simulations - the application of sparse grids ⋮ Approximating mixed Hölder functions using random samples ⋮ Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices ⋮ Generalized sparse grid interpolation based on the fast discrete Fourier transform ⋮ 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
Uses Software
Cites Work
- A note on the construction of \(L\)-fold sparse tensor product spaces
- Spaces of functions of mixed smoothness and approximation from hyperbolic crosses
- On the stability of the hyperbolic cross discrete Fourier transform
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- Dimension-wise integration of high-dimensional functions with applications to finance
- Principal manifold learning by sparse grids
- Tractability of quasilinear problems. I: General results
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- Tensor products of Sobolev-Besov spaces and applications to approximation from the hyperbolic cross
- The jackknife estimate of variance
- Fouriertransform on sparse grids with hierarchical bases
- Best multivariate approximations by trigonometric polynomials with frequencies from hyperbolic crosses
- Dimension-adaptive tensor-product quadrature
- Optimized tensor-product approximation spaces
- Sparse grids for boundary integral equations
- Finite-order weights imply tractability of linear multivariate problems
- Finite-order weights imply tractability of multivariate integration
- High dimensional polynomial interpolation on sparse grids
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations
- Distributions, Sobolev spaces, elliptic equations
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Optimized general sparse grid approximation spaces for operator equations
- Algorithm 847
- Spectral Methods for Uncertainty Quantification
- Spectral and Pseudo Spectral Methods for Advection Equations
- On the construction of sparse tensor product spaces
- The calculation of linear least squares problems
- Numerical solution of parabolic equations in high dimensions
- Sparse Spectral Approximations of High-Dimensional Problems Based on Hyperbolic Cross
- Sparse grids for the Schrödinger equation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast Discrete Fourier Transform on Generalized Sparse Grids
