Lattice rules for multivariate approximation in the worst case setting
From MaRDI portal
(Redirected from Publication:5482373)
algorithmserror boundsFourier coefficientslattice rulesmultivariate approximationperiodic functionstrigonometric polynomialsweighted Korobov spacesworst case setting
Multidimensional problems (41A63) Trigonometric approximation (42A10) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Completeness of sets of functions in one variable harmonic analysis (42A65) Numerical methods for trigonometric approximation and interpolation (65T40)
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
(45)- On the power of standard information for multivariate approximation in the worst case setting
- On the approximation of smooth functions using generalized digital nets
- An iterative computation of approximations on Korobov-like spaces.
- Tractability of \(\mathbb{L}_2\)-approximation in hybrid function spaces
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture
- Multivariate approximation by translates of the Korobov function on Smolyak grids
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- 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 sampling along rank-1 lattice with generating vector of Korobov form
- \(\mathbb{L}_\infty\)-approximation in Korobov spaces with exponential weights
- 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
- Approximation of analytic functions in Korobov spaces
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- Periodization strategy may fail in high dimensions
- Lattice rule algorithms for multivariate approximation in the average case setting
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: worst case setting
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Approximation in Hermite spaces of smooth functions
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- The power of standard information for multivariate approximation in the randomized setting
- Ian Sloan and Lattice Rules
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Strang splitting in combination with rank-1 and rank-r lattices for the time-dependent Schrödinger equation
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Tractability of \(L_2\)-approximation and integration in weighted Hermite spaces of finite smoothness
- Homogeneous algorithms and solvable problems on cones
- Selected aspects of tractability analysis
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- Comparison of two search criteria for lattice-based kernel approximation
- Lattice-based kernel approximation and serendipitous weights for parametric PDEs in very high dimensions
- Constructing embedded lattice-based algorithms for multivariate function approximation with a composite number of points
- Multivariate integration and approximation in weighted Sobolev spaces of low fractional smoothness
- L₂-approximation using randomized lattice algorithms
- Multidimensional pseudo-spectral methods on lattice grids
- Spline methods using integration lattices and digital nets
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
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)
