Efficient multivariate approximation on the cube
From MaRDI portal
Publication:1996231
DOI10.1007/s00211-021-01177-9zbMath1464.65294arXiv1912.03090OpenAlexW3122152963MaRDI QIDQ1996231
Publication date: 3 March 2021
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03090
Numerical methods for discrete and fast Fourier transforms (65T50) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05)
Related Items
A convergent iterated quasi-interpolation for periodic domain and its applications to surface PDEs ⋮ A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals
Cites Work
- 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\)
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Randomly shifted lattice rules for unbounded integrands
- A diagonal embedding theorem for function spaces with dominating mixed smoothness
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Lattice rules in non-periodic subspaces of Sobolev spaces
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- On efficient weighted integration via a change of variables
- Transformed rank-1 lattices for high-dimensional approximation
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Constructing lattice rules based on weighted degree of exactness and worst case error
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- Lattice rules for nonperiodic smooth integrands
- Periodization strategy may fail in high dimensions
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
- Spectral Methods
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- Quasi-Monte Carlo methods and pseudo-random numbers
- Fast Discrete Fourier Transform on Generalized Sparse Grids
- Summability of Multi-Dimensional Trigonometric Fourier Series
- High-dimensional integration: The quasi-Monte Carlo way
