Lattice rules for multivariate approximation in the worst case setting
From MaRDI portal
Publication:5482373
algorithmserror boundsFourier coefficientstrigonometric polynomialsworst case settingmultivariate approximationperiodic functionslattice rulesweighted Korobov spaces
Trigonometric approximation (42A10) Numerical methods for trigonometric approximation and interpolation (65T40) Multidimensional problems (41A63) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Completeness of sets of functions in one variable harmonic analysis (42A65)
Recommendations
- Lattice rule algorithms for multivariate approximation in the average case setting
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Tractability of multivariate integration for periodic functions
- Approximation of analytic functions in Korobov spaces
- Good lattice rules in weighted Korobov spaces with general weights
Cited in
(40)- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- Ian Sloan and Lattice Rules
- Selected aspects of tractability analysis
- How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings
- Spline methods using integration lattices and digital nets
- Approximation in Hermite spaces of smooth functions
- On the approximation of smooth functions using generalized digital nets
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- \(\mathbb{L}_\infty\)-approximation in Korobov spaces with exponential weights
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- On the power of standard information for multivariate approximation in the worst case setting
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Multidimensional pseudo-spectral methods on lattice grids
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- Tractability of \(L_2\)-approximation and integration in weighted Hermite spaces of finite smoothness
- Periodization strategy may fail in high dimensions
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Tractability of \(\mathbb{L}_2\)-approximation in hybrid function spaces
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: worst case setting
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
- Approximation of analytic functions in Korobov spaces
- An iterative computation of approximations on Korobov-like spaces.
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture
- Lattice rule algorithms for multivariate approximation in the average case setting
- Strang splitting in combination with rank-1 and rank-\(r\) lattices for the time-dependent Schrödinger equation
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Multivariate approximation by translates of the Korobov function on Smolyak grids
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- The power of standard information for multivariate approximation in the randomized setting
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Homogeneous algorithms and solvable problems on cones
- Constructing lattice rules based on weighted degree of exactness and worst case error
This page was built for publication: Lattice rules for multivariate approximation in the worst case setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482373)
