Comparison of two search criteria for lattice-based kernel approximation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- scientific article; zbMATH DE number 5049869 (Why is no real title available?)
- A Belgian View on Lattice Rules
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
- A sharp upper bound for sampling numbers in \(L_2\)
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- Constructing embedded lattice-based algorithms for multivariate function approximation with a composite number of points
- Error estimates and condition numbers for radial basis function interpolation
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Function values are enough for \(L_2\)-approximation. II
- High-dimensional integration: The quasi-Monte Carlo way
- Kernel techniques: From machine learning to meshless methods
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Lattice rules for multivariate approximation in the worst case setting
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- Local error estimates for radial basis function interpolation of scattered data
- Near-optimal data-independent point locations for radial basis function interpolation
- On figures of merit for randomly-shifted lattice rules
- On the reconstruction of functions from values at subsampled quadrature points
- Spline methods using integration lattices and digital nets
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Tractability of approximation for weighted Korobov spaces on classical and quantum computers
This page was built for publication: Comparison of two search criteria for lattice-based kernel approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012108)
