Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
From MaRDI portal
Publication:1704862
DOI10.1007/s00041-016-9520-8zbMath1401.65155OpenAlexW2567197523MaRDI QIDQ1704862
Publication date: 13 March 2018
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-016-9520-8
fast Fourier transformlattice rulemultiple rank-1 latticesparse multivariate trigonometric polynomials
Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness ⋮ Nonlinear approximation in bounded orthonormal product bases ⋮ A sparse FFT approach for ODE with random coefficients ⋮ Efficient multivariate approximation on the cube ⋮ Transformed rank-1 lattices for high-dimensional approximation ⋮ A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size ⋮ Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in \(H^\gamma\)
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- On the stability of the hyperbolic cross discrete Fourier transform
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- Multidimensional pseudo-spectral methods on lattice grids
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Estimation of the eigenvalues and the smallest singular value of matrices
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Fouriertransform on sparse grids with hierarchical bases
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Lattice rule algorithms for multivariate approximation in the average case setting
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Component-by-component construction of good lattice rules
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
- Quasi-Monte Carlo methods and pseudo-random numbers
- Structured random measurements in signal processing
- Fast Discrete Fourier Transform on Generalized Sparse Grids
- High-dimensional integration: The quasi-Monte Carlo way
